#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

Input a list of connected nodes, and output its adjacency list.

## Input

2 Integers, *n* and *e*. *n* represents the amount of nodes and *e* represents the amount of edges. You may assume *n*, *e* is less than 10000.

The following *e* lines will have 2 integers each, *e _{a}* and

*e*. It means

_{b}*e*is connected to

_{a}*e*(bi-directional)

_{b}## Output

Output the adjacency list

## Sample Input

5 8 1 2 1 3 1 4 1 5 2 4 3 5 5 4 3 4

## Sample Output

2 3 4 5 1 4 1 5 4 1 2 5 3 1 3 4

**They have to outputed in the order in the input**

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 100 | 10 | 1s | 32MB | Average |

2 | 0 | 1 | 1s | 32MB | Average |

### Judge Compile Command

g++-8 ans.cpp -o adjlist -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512