Problem H |
Morning Walk |
Time Limit |
3 Seconds |
Kamal
is a Motashota
guy. He has got a new job in
Input
Input will consist of several test cases. Each test case will start with a line containing two numbers. The first number indicates the number of road intersections and is denoted by N (2 ≤ N ≤ 200). The road intersections are assumed to be numbered from 0 to N-1. The second number R denotes the number of roads (0 ≤ R ≤ 10000). Then there will be R lines each containing two numbers c1 and c2 indicating the intersections connecting a road.
Output
Print a single line containing the text “Possible” without quotes if it is possible for Kamal to visit all the roads exactly once in a single walk otherwise print “Not Possible”.
Sample Input |
Output for Sample Input |
2 2 0 1 1 0 2 1 0 1 |
Possible Not Possible |
Problemsetter: Muhammad
Abul Hasan
International Islamic
University