As an experiment the Educational Codeforces Round 33 will be rated for Div. 2.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Bertown roads

time limit per test

5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputBertown has *n* junctions and *m* bidirectional roads. We know that one can get from any junction to any other one by the existing roads.

As there were more and more cars in the city, traffic jams started to pose real problems. To deal with them the government decided to make the traffic one-directional on all the roads, thus easing down the traffic. Your task is to determine whether there is a way to make the traffic one-directional so that there still is the possibility to get from any junction to any other one. If the answer is positive, you should also find one of the possible ways to orient the roads.

Input

The first line contains two space-separated integers *n* and *m* (2 ≤ *n* ≤ 10^{5}, *n* - 1 ≤ *m* ≤ 3·10^{5}) which represent the number of junctions and the roads in the town correspondingly. Then follow *m* lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers *a*_{i} and *b*_{i} (1 ≤ *a*_{i}, *b*_{i} ≤ *n*, *a*_{i} ≠ *b*_{i}) — the numbers of junctions it connects.

It is guaranteed that one can get from any junction to any other one along the existing bidirectional roads. Each road connects different junctions, there is no more than one road between each pair of junctions.

Output

If there's no solution, print the single number 0. Otherwise, print *m* lines each containing two integers *p*_{i} and *q*_{i} — each road's orientation. That is the traffic flow will move along a one-directional road from junction *p*_{i} to junction *q*_{i}. You can print the roads in any order. If there are several solutions to that problem, print any of them.

Examples

Input

6 8

1 2

2 3

1 3

4 5

4 6

5 6

2 4

3 5

Output

1 2

2 3

3 1

4 5

5 6

6 4

4 2

3 5

Input

6 7

1 2

2 3

1 3

4 5

4 6

5 6

2 4

Output

0

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/23/2017 15:55:10 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|