/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.util.*;

public class b {
	static int n,s,p;
	static int[] v;
	static int[][] memo;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int t=1; t<=T; t++) {
			n = in.nextInt();
			s = in.nextInt();
			p = in.nextInt();
			v = new int[n];
			for(int i=0; i<n; i++)
				v[i] = in.nextInt();
			memo = new int[n][s+1];
			for(int[] x : memo) Arrays.fill(x,-1);
			System.out.printf("Case #%d: %d%n", t, go(0,s));
		}
	}
	static int go(int pos, int left) {
		if(left < 0) return -10000;
		if(pos == n) return left == 0 ? 0:-10000;	
		if(memo[pos][left] != -1) return memo[pos][left];
		int best = -10000;
		for(int i=0; i<=10; i++)
			for(int j=i; j<=i+2; j++)
				for(int k=j; k<=i+2; k++)
					if(i+j+k==v[pos]) {
						int sup = 0;
						if(k-i==2) sup = 1;
						int win = 0;
						if(k >= p) win = 1;
						best = Math.max(best,win+go(pos+1,left-sup));
					}
		return memo[pos][left] = best;
	}
}