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.FileReader;
import java.io.IOException;
import java.io.PrintWriter;



public class BDancingWithTheGooglers {
	
	static int dance(int n, int s, int p, int[] tot) {
		int count = 0;
		int countSurprise = 0;
		int min = p + 2*Math.max(0, p - 1);
		int minSurprise = p + 2*Math.max(0, p - 2);
		for(int i = 0; i < n; ++i) {
			if(tot[i] >= min) {
				++count;
				continue;
			}
			if(tot[i] >= minSurprise && countSurprise < s) {
				++count;
				++countSurprise;
			}
		}
		
		return count;
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		String filename = "B-large.in";
		BufferedReader r = new BufferedReader(new FileReader(filename));
		int t = Integer.parseInt(r.readLine());
		PrintWriter p = new PrintWriter("b.out");
		for(int i = 0; i < t; ++i) {
			String[] test = r.readLine().split(" ");
			int n = Integer.parseInt(test[0]);
			int s = Integer.parseInt(test[1]);
			int pp = Integer.parseInt(test[2]);
			int[] tot = new int[n];
			for(int a = 0; a < n; ++a) {
				tot[a] = Integer.parseInt(test[3 + a]);
			}
			int j = i + 1;
			p.println("Case #" + j + ": " +  dance(n, s, pp, tot));
			
		}
		p.flush();
		p.close();
	}

}
