eolymp
bolt
Try our new interface for solving problems
Problems

Railroad

Railroad

Oddly, but in our country decided to do first, and then think. In the same way this time: the Ministry of Transport issued an order to create the country's railway network, and then just a month the whole country was covered rails. Naturally, we decided to save money and did not carry more than one track between the two cities. And now everything was ready to let the first train, as in the case entered the Security Council and MOE. They also decided that for safety reasons on each path the train will go always in one direction, and that is in our interest as soon as possible to determine which. Thus, faced a serious problem - to assign each track railway, which connects directly to the two cities, one of two possible directions. In this case, the Ministry of Transport chose to designate areas to be able to put as many trains in this new system of railways. Between the two cities can be sent no more than one train and only if one of the city can get to the other and go back to the light rail lines. Given to you plan to railroad tracks. Want to display only the maximum number of trains that can be sent at the optimal choice of destinations. Determine the direction is not necessary - yet at the Ministry of Transport are working decent people - they do it themselves. \InputFile In the first row are given two numbers \textbf{N} and \textbf{K} (\textbf{1} ≤ \textbf{N} ≤ \textbf{10000}, \textbf{0} ≤ \textbf{K} ≤ \textbf{100000}) - the number of cities and built railroads, respectively. The following \textbf{K} lines of two numbers \textbf{A} and \textbf{B} (\textbf{1} ≤ \textbf{A}, \textbf{B} ≤ \textbf{N}) - number of cities, among which was built by a straight road. \OutputFile In a single line display the maximum number of running trains.
Time limit 1 second
Memory limit 64 MiB
Input example #1
6 7
1 2
2 3
3 1
4 5
5 6
6 4
3 4
Output example #1
6
Author A. Milanin