Count the edges whose removal increases the number of connected components of an undirected graph.

Input

The first line contains n and m. The next m lines contain undirected edges.

• 1 <= n <= 1000

Output

Print the number of bridges.

Example

Input

5 5
1 2
2 3
3 1
3 4
4 5

Output

2