* Line 1: Two integers, N and M.

* Lines 2..M+1: Two integers denoting a pair of fields connected by a path.

内存限制：64 MiB 时间限制：5 Sec

Bessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, makes her patrol, and then returns to the barn when she's done. If she were a more observant cow, she might be able to just walk each of M (1 <= M <= 50,000) bidirectional trails numbered 1..M between N (2 <= N <= 10,000) fields numbered 1..N on the farm once and be confident that she's seen everything she needs to see. But since she isn't, she wants to make sure she walks down each trail exactly twice. It's also important that her two trips along each trail be in opposite directions, so that she doesn't miss the same thing twice. A pair of fields might be connected by more than one trail. Find a path that Bessie can follow which will meet her requirements. Such a path is guaranteed to exist.

约翰有N(2≤N≤10000)个农场，它们由M(1≤M≤50000)条双向路连接．贝茜从农场1出发去巡逻．每条路必须由两个方向各走一遍，最后回到农场1．题目保证这样的路径存在．请输出这样的路径．

* Line 1: Two integers, N and M.

* Lines 2..M+1: Two integers denoting a pair of fields connected by a path.

第1行输入N，M;

之后M行输入一条路的两个端点．

* Lines 1..2M+1: A list of fields she passes through, one per line, beginning and ending with the barn at field 1. If more than one solution is possible, output any solution.

输出经过的农场，一行一个．

```
4 5//四个点,五条边
```

1 2

1 4

2 3

2 4

3 4

```
1
```

2

3

4

2

1

4

3

2

4

1

OUTPUT DETAILS:

Bessie starts at 1 (barn), goes to 2, then 3, etc...

请不要提交....