You have $n$ computers, numbered $1, 2, \dotsc, n$, and you need to find the best way to route data packets in a computer network.
There are $m$ routing requests. Each routing request is of the form $(x,y)$, which indicates that you will need to transmit 1 data packet from computer $x$ to computer $y$. We say that $x$ is the source and $y$ is the destination of this data packet.
You know that each computer is the source of at most $n$ data packets, and each computer is the destination of at most $n$ data packets.
There are bidirectional communication links between all pairs of computers. In one
round, you can send at most one data packet from $x$ to $y$ and at most one data packet from $y$ to $x$, for each pair of computers $(x,y)$.
Note that you do not need to send data packets directly to their final destinations. You can also keep any number of data packets waiting at any computer. Hence to process a routing request $(10,20)$ in a network with $n = 30$ computers, one solution might be to send the packet first from $10$ to $30$, then let it wait for one round at $30$, and finally send it from $30$ to $20$. The only restriction is that in each round each communication link carries at most one packet per direction.
Your task is to
minimize the number of rounds needed to transmit all data packets to their final destinations.
Input
The first input line has one integer $t$: the number of test cases.
Each test case begins with a line that contains two integers $n$ and $m$: the number of computers and routing requests. After this, there are $m$ lines. Each line represents one routing request: it contains two integers $x$ and $y$ which indicate that there is one packet with source $x$ and target $y$.
Output
For each test case, print one line: the smallest number of rounds in which you can route all requests to their final destinations.
Limits
- $1 \le t \le 10$
- $1 \le n \le 1000$
- $1 \le m \le 10^5$
Example
Input:
2
10 3
1 2
2 1
3 4
10 3
1 2
1 2
3 4
Output:
1
2
Explanation:
- In the first test case, there is a one-round solution: in the first round we transmit a packet from 1 to 2, a packet from 3 to 4, and a packet from 2 to 1.
- In the second test case, there is no one-round solution. However, there are several two-round solutions. For example, in the first round we could send a packet from 1 to 2 and a packet from 3 to 4 (one packet would be simply waiting at node 1). Then in the second round we could send another packet from 1 to 2, and now all packets are in their final destinations.