Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the same vertex. The task is to find that there exists the Euler Path or circuit or none.

Input:
First line consists of test cases T. First line of every test case consists of 2 integers V and E, denoting the number of vertex and edges. Second line of every test case consists of 2*E spaced integers denoting the edge connected.

Output:
Return the int value to print 1 if Euler path exists print 2 if Euler cycle exists else 0.

Constraints:
1<=T<=100
1<=V,E<=100

Example:
Input:
1
5 6
1 0 0 2 2 1 0 3 3 4
Output:
1

** For More Input/Output Examples Use 'Expected Output' option **