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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
public class Dancers {

	public static void main(String[] args) throws Exception {
		PrintWriter out = new PrintWriter("output.out");
		Scanner in = new Scanner(new File("B-small-attempt5.in"));
        int testCases = in.nextInt();
        for (int i = 1; i <= testCases; i++){
        	int N = in.nextInt(),counter=0;
        	int S = in.nextInt();
        	int P = in.nextInt();
        	for(int j = 0 ; j < N ;j++){
        		int googler= in.nextInt();
        		if(googler%3 == 0){
        			if(googler/3 >= P){
        				counter++;
        			}
        			else if(googler/3 + 1 >= P && S!=0){
        				counter++;
        				S--;
        			}
        		}
        		else if(googler%3==1){
        			if(googler/3 + 1 >= P){
        				counter++;
        			}
        		}
        		else if(googler%3==2){
        			if(googler/3 + 1 >= P){
        				counter++;
        			}
        			else if(googler/3 + 2 >= P && S!=0){
        				counter++;
        				S--;
        			}
        		}
        	}
        	out.printf("Case #%d: %d",i,counter);
        	out.printf("\n");
        }
        out.close();
        in.close();

	}

}