import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

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

}
