|Source : ACM ICPC Beijing Regional Contest 2002|
|Time limit : 1 sec||Memory limit : 32 M|
Submitted : 1452, Accepted : 627
Given your cards received at the beginning, write a program to tell the maximal number of rounds that you may at least win during the whole game.
The input consists of several test cases. The first line of each case contains two integers m (2 m 20) and n (1 n 50), representing the number of players and the number of cards each player receives at the beginning of the game, respectively. This followed by a line with n positive integers, representing the pips of cards you received at the beginning. Then a blank line follows to separate the cases.
The input is terminated by a line with two zeros.
For each test case, output a line consisting of the test case number followed by the number of rounds you will at least win during the game.
2 5 1 7 2 10 9 6 11 62 63 54 66 65 61 57 56 50 53 48 0 0
Case 1: 2 Case 2: 4