Description: Problem input
Inputs include multiple test cases, test cases given first number N, then given N test cases, 1 ≤ N ≤ 100.
Each test includes M+1 rows, first give two integers K and M then in turn gives M lines, each given two different positive integers i and j, represent two different i and j belong to the same family and friends friends and relatives, i ≠ j, 1 ≤ i ≤ K, 1 ≤ j ≤ K,, 1 ≤ K ≤ 10000,1 ≤ M ≤ 10000.
Problem Output
The output includes a multi-line, for each test case, output a line, given the number of independent regional division of the most needed.
Sample Input
2
31
12
32
12
23
Sample Output
2
1
To Search:
File list (Check if you may need any files):
B_xuanba.doc
Download