import java.util.Scanner;
public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int zz = 1; zz <= T;zz++){
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int x = 0;
			for(int i = 0; i < N;i++){
				int score = in.nextInt();
				int best = score/3;
				int mod = score%3;
				int diff = p-best;
				if(diff<1){
					x++;
				}else if(diff<2){
					if(mod==0 && score !=0){
						if(S!=0){
							S--;x++;
						}
					}else if(score!=0){
						x++;
					}
				}else if(diff<3){
					if(mod==2){
						if(S!=0){
							S--;x++;
						}
					}
				}
			}
			System.out.format("Case #%d: %d\n", zz, x);
		}
	}
}

import java.io.*;

public class Qualifying_B {

	public static void main(String[] args) throws Exception {
        BufferedReader input = new BufferedReader(new FileReader(args[0]));
        int T = Integer.parseInt(input.readLine());
        
        for (int t = 1; t <= T; t++) {
        	String[] tokens = input.readLine().split(" ");
        	
        	int N = Integer.parseInt(tokens[0]);
        	int S = Integer.parseInt(tokens[1]);
        	int p = Integer.parseInt(tokens[2]);
        	int[][] Googlers = new int[N][3];
        	
        	for (int n = 0; n < N; n++) {
        		Googlers[n][0] = Integer.parseInt(tokens[3 + n]);
        		Googlers[n][1] = Googlers[n][0] / 3 + ((Googlers[n][0] % 3 != 0) ? 1 : 0);
        		Googlers[n][2] = (Googlers[n][0] < 2 || Googlers[n][0] > 28) ? -1 : (Googlers[n][0] - 2) / 3 + 2;
        	}

        	int m = 0;
        	
        	for (int n = 0; n < N; n++) {
        		if (Googlers[n][1] >= p)
        			m++;
        		else if (Googlers[n][2] >= p && S > 0) {
        			S--;
        			m++;
        		}
        	}
        	
        	System.out.println("Case #" + t + ": " + m);
        }		
	}
}
