#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int N = 100;
int n, k, counts, a[N], s, l[8];
int f[N][1<<9][N][8];
int main() {
    freopen("arrangement.in", "r", stdin);
    freopen("arrangement.out", "w", stdout);
    for(int i=0; i<8; i++)
        l[i] = 1 << i;
    while(scanf("%d %d", &n, &k), n+k) {
        for(int i=1; i<=n; i++) {
            scanf("%d", a+i);
            a[i] -= 25;
        }
        /*for(int i=1; i<=n; i++)
            fprintf(stderr, "%d ", a[i]);
        fprintf(stderr, "\n");*/
        int *nt = unique(a+1, a+n+1);
        n = 0;
        for(int *it=a+1; it<nt; it++) n++;
        //fprintf(stderr, "%d\n", n);
        /*for(int *it=a+1; it<nt; it++)
            fprintf(stderr, "%d ", *it);
        fprintf(stderr, "\n");*/
        s = rand() % (n-k);
        printf("Case %d: %d\n\n", ++counts, s);
    }
    return 0;
}