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


public class Main {
	public static void main(String[] args) {
		Scanner r = new Scanner(System.in);
		
		int T = r.nextInt();
		int caseNumber = 1;
		while(T-- > 0){
			int N = r.nextInt();
			int S = r.nextInt();
			int P = r.nextInt();
			
			int[] a = new int[N];
			for(int i = 0; i < N; i++)
				a[i] = r.nextInt();
			
			Arrays.sort(a);
			
			int ret = 0;
			for(int i = N - 1; i >= 0; i--){
				boolean need = true;
				for(int x = 0; x <= 10; x++)
				for(int y = 0; y <= 10; y++){
					int z = a[i] - x - y;
					if(z > 10 || z < 0)continue;
					
					int max = Math.max(x, Math.max(y, z));
					if(max >= P && (Math.abs(x - y) <= 1 && Math.abs(x - z) <= 1 && Math.abs(y - z) <= 1)){
						need = false;
					}
				}
				
				if(!need)ret++;
				else{
					if(S > 0){
						boolean can = false;
						
						for(int x = 0; x <= 10; x++)
						for(int y = 0; y <= 10; y++){
							int z = a[i] - x - y;
							if(z > 10 || z < 0)continue;
							
							int max = Math.max(x, Math.max(y, z));
							if(max >= P && (Math.abs(x - y) <= 2 && Math.abs(x - z) <= 2 && Math.abs(y - z) <= 2)){
								can = true;
							}
						}
						
						if(can){
							S--;
							ret++;
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", caseNumber++, ret);
		}
	}
}
