Suppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at most N*M. And there are no two cards with the same pip. During a round, each player chooses one card to compare with others. The player whose card with the biggest pip wins the round, and then the next round begins. After N rounds, when all the cards of each player have been chosen, the player who has won the most rounds is the winner of the game. 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.

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[1010],b[1010],used[1010];
int main()
{
	int n,m,i,j,sum,flag=1;
	while(scanf("%d %d",&m,&n)!=EOF&&(n||m))
	{
		sum=0;
		memset(a,1,sizeof(a));
		memset(used,1,sizeof(used));
		for(i=1;i<=n;i++)
		{
			scanf("%d",&b[i]);
			a[b[i]]=0;
		}
		sort(b,b+n);
		
		for(i=1;i<=n*m;i++)
		{
			if(a[i])
			{
			for(j=1;j<=n;j++)
			{
				if(i>b[j]&&used[j])
				{					
					sum++;
					used[j]=0;
					break;
				}
		   }
	       }			
		}
		printf("Case %d: %d\n",flag,n-sum);
		flag++;
	}
}