22183_Houses

There are several houses in a village. Houses are connected by roads, since building a road will cost much money, any two houses are connected by at most one road, and every road is guaranteed to connect two different houses.

In the village, the smartest people always live in the most convenient house, and the most convenient house is a house connecting to the maximum number of houses. Now it is your task to find out the number of houses connecting to the most convenient house.

There're multiple cases. The first line of each case contains two integers n and m ( 1 ≤ n ≤ 20,  0 ≤ m ≤ 20 ), indicating the number of houses and the number of roads, houses are numbered from 1 to n. Then for each of the following m lines, there are two different integers a and b ( 1 ≤ a, b ≤ n ), indicating that there is a road connecting house a and house b. Input is terminated by two 0's.

For each case output the result in one line.

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

0
0
1
2
2

请忽略本题。