import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;


public class Second {

	public static void main(String[] args) {
		
		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File("input.txt")));
			PrintWriter writer = new PrintWriter(new FileWriter(new File("output.txt")));
			reader.readLine(); // T
			int num = 1;
			String str = "";
			while((str = reader.readLine()) != null){
				String[] temp = str.split(" ");
				int result = 0;
				int n = Integer.parseInt(temp[0]); // how many dancers
				int s = Integer.parseInt(temp[1]); // surprising scores
				int p = Integer.parseInt(temp[2]); // at least p points
				int t[] = new int[n];
				for(int i = 0; i < n; i++) {
					t[i] = Integer.parseInt(temp[i + 3]);
					int k = t[i] / 3;
					int normalMax, suprisingMax;
					if(t[i] % 3 == 0){
						normalMax = k;
						suprisingMax = k + 1;
					} else if(t[i] % 3 == 1){
						normalMax = k + 1;
						suprisingMax = k + 1;
					} else { // t[i] % 3 == 2
						normalMax = k + 1;
						suprisingMax = k + 2;
					}
					if(normalMax >= p) result++;
					else if(s > 0 && suprisingMax >= p){
						if(t[i] == 0 || t[i] == 29 || t[i] == 30) continue;
						s--;
						result++;
					}
				}
				writer.println("Case #" + num + ": " + result);
				num++;
			}
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
