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

public class DancingWithTheGooglers {

    private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));    
    private static StringTokenizer st;

    public static void main ( String [] args ) throws IOException
    {
	int T = Integer.parseInt(br.readLine());

	for(int i = 0;i < T; i++) {
	    System.out.print("Case #" + (i+1) + ": ");
	    new DancingWithTheGooglers().cal();
	}
    }

 
    private void cal() throws IOException 
    {
	int N, S, p;
	
	st = new StringTokenizer(br.readLine());
	N = Integer.parseInt(st.nextToken());
	S = Integer.parseInt(st.nextToken());
	p = Integer.parseInt(st.nextToken());

	int [] t = new int [N];
	for(int i = 0; st.hasMoreTokens(); i++) 
	    t[i] = Integer.parseInt(st.nextToken());

	/*
	for(int i : t)
	    System.out.println(i);
	*/

	int num = 0;
	for(int n : t) {
	    int q = n / 3;
	    int r = n % 3;

	    //	    System.out.println(q + " " + r);

	  
	    if ( r == 0 && q >= p) {
		num++;
	    } else if ( r == 0 && q != 10 && q != 0 && q + 1 >= p && S > 0 ) {
		num++; S--;
	    }
	    else if ( r == 1 && q + 1 >= p) {
		num++;
	    } else if ( r == 2 && q + 1 >= p) {
		num++;
	    } else if ( r == 2 && q + 2 >= p && S > 0) {
		num++; S--;
	    }

	}

	System.out.println(num);
	
    }

}
