Neighbor Friend

Time Limit: 1000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 2868
64-bit integer IO format: %I64d      Java class name: Main

Description

Suppose we sort N persons in a line according to their heights,we are curious about the Neighbor Friend.
A pair of Neighbor Friend is two person next to each other in the line,ignoring the order(ie (x,y) and (y,x)is the same).
Now you are given M pieces of infomation,each with two integer a and b,discribing that person a is shorter than person b.
Can you find how many different pairs of Neighbor Friend that could occur in some of the sorted line?

Input

Input contains multiple cases.
Each test case starts with two integer N(2<=N<=200) ,M(0<=M<1000) ,indicating that there are N persons and M pieces of information.Follow by M lines,each line contains two integers a and b,represents that person a is shorter than person b.

Output

For each test case, output the different pairs of Neighbor Friend that could occur in some of the sorted line.

Sample Input

3 1
1 2
3 2
1 2
2 3

Sample Output

3
2

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .