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.util.Scanner;


public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int cases = Integer.parseInt(sc.nextLine());
		
		for(int i = 0; i < cases; i++) {
			Scanner line = new Scanner(sc.nextLine());
			int triplets = line.nextInt();
			int surprise = line.nextInt();
			int threshold = line.nextInt();
			
			int enough = 0;
			int borderline = 0;
			
			while(line.hasNextInt()) {
				int score = line.nextInt();
				if(score == 0) {
					if(threshold == 0) {
						enough++;
					}
				}
				else if(score == 1) {
					if(threshold <= 1) {
						enough++;
					}
				}
				else {
					int maxS, maxNS;
					
					int mod = score % 3;
					int div = score / 3;
					if(mod == 0) {
						maxS = div+1;
						maxNS = div;
					}
					else if(mod == 1) {
						maxS = div+1;
						maxNS = div+1;
					}
					else {
						maxS = div+2;
						maxNS = div+1;
					}
					
					if(threshold <= maxNS) {
						enough++;
					}
					else {
						if(threshold <= maxS) {
							borderline++;
						}
					}
					
				}
			}
			
			System.out.printf("Case #%d: %d\n", i+1, enough + Math.min(borderline, surprise));
		}

	}

}

