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;
    }
}


package codjam;

import java.util.*;

public class DancingWithTheGooglers {
	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt();
		
		for (int k = 1; k <= T; k++) {
			
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			
			int c = 0;
			int To = 0;
			
			for (int i = 0; i < N; i++) {
				
				To = in.nextInt();
				int a = To/3; // Integer division
				int n = To%3;
				if (To == 0) {
					if (p == 0) c++;
				} else {
					int tmax = (n == 0) ? a : a+1;
					if (tmax >= p) {
						c++;
						continue;
					} else if (S > 0 && tmax == p-1 && (n == 0 || n == 2)) {
						S--;
						c++;
						continue;
					}
				}
				
			}
			
			System.out.println("Case #" + k + ": " + c);
			
		}
		
	}

}
