After the Cold War ended, the UNO decided that the world should be connected. It should not again be bipolar. So, it decided to ensure the well-being of critical relationships between nations. By critical, UNO means that upsetting such realtionships will divide the world into two groups of nation(s).

There are N countries numbered from 0 to N-1. All friendships are mutual (friendship from both sides or no relationship). There are M friendly pairs in the world. So, UNO gave you the list of pairs of friendly countries and asks you to count the number of critical relationships in the world so that it work upon ensuring World Peace.

Input Specifications
First line contains two integers N and M. M lines follow each containing a pair of two friendly countries (Ci1,Ci2). Each test case is followed by a blank line. Read till EOF.

Output Specifications
For every test case, output an integer giving the count of number of critical relationships.

Constraints
Test Cases < 20
0 < N <= 105
0 < M <= 105
0 <= Ci1,Ci1 < N

Sample Cases
Input
3 3
1 0
0 2
1 2

6 6
0 1
3 1
3 2
3 4
1 2
4 5

Output
0
3

Explanation
Case 1 : No critical relationships.
Case 2 : Critical relationships are (0,1), (3,4) and (4,5)

Editorial

Problem Tester : Dhruva Bhaswar

Languages: AWK,Bash,Brain,C,C++,Java,C#,JavaScript,Pascal,Perl,PHP,Python,Python3,Ruby,Text

Time Limit: 3 Second(s)
Score: 100 Point(s)
Input File Limit: 50000 Bytes

Mode Judge

RankNameScore
1xyz0
2Ams0
3TIP0
4team420
5xyzz0
6asdasdasd0
7abcd0
8khankhan0
9Gabriel0
10gigel0