#include <cstdio>
#include <algorithm>
#define MAX_N 150
using namespace std;
int N, M, A[MAX_N];
int main(int argc,char *argv[]) {
	int T = 0;
	while (scanf("%d%d", &M, &N) == 2 && N * M != 0) {
		++T;
		for (int i = 1;i <= N;++i) scanf("%d",&A[i]);
		sort(A + 1, A + N + 1);
		int pc = N * M + 1, pm = N, b = 0, ans = 0;
		while (--pc >= 1) {
			if (pc == A[pm]) {
				if (b == 0) ++ans; else --b;
				--pm;
			}
			else ++b;
		}
		printf("Case %d: %d\n", T, ans);
	}
	return 0;
}