import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

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

import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.regex.Pattern;

/**
 *
 * @author Tobi
 */
public class GoogleCodeJam {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int T = s.nextInt();
        for(int t = 1; t <= T; t++) {
            int N = s.nextInt(); //number of googlers
            int S = s.nextInt(); //number of surprising results
            int p = s.nextInt(); //number of target-best result
            int[] points = new int[N];
            for(int i = 0; i < N; i++)
                points[i] = s.nextInt();
            
            int matches = 0;
            for(int i = 0; i < N; i++) {
                if((points[i] / 3) + 2 < p) //skip results that are too low
                    continue;
                int a = points[i] / 3;
                int b = (points[i] - a) / 2;
                int c = (points[i] - a - b);
                int max = Math.max(Math.max(a, b), c);
                int delta = Math.max(Math.max(Math.abs(b - c), Math.abs(a - b)), Math.abs(a - c));
                
                if(max >= p) {
                    if(delta == 2 && S > 0) { //enough points, but surprising, surprises left?
                        S--;
                        matches++;
                        continue;
                    } else if (delta < 2) { //enough points, no surprise
                        matches++;
                        continue;
                    }
                }
                
                if((max + 1 >= p) && (delta < 2)) {
                    if((S > 0) && (delta == 0) && max > 0) { //can shift one point up and one down -> delta == 2 -> surprise left?
                        S--;
                        matches++;
                    } else if (S > 0 && delta == 1 && ((a == b && a == max) || (a == c && a == max) || (b == c && b == max))) { //can shift one point up, one down, but delta 
                        S--;
                        matches++;
                    }
                }
            }
            System.out.println("Case #" + t + ": " + matches);
        }
    }
}
