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


