/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.io.* ;
import java.text.DecimalFormat;
import java.util.*;
import static java.lang.Math.* ;
import static java.util.Arrays.* ;

public class B {
	
	public static void main(String[] args) throws FileNotFoundException {
		
		in = new Scanner(new InputStreamReader(new FileInputStream("b_in.txt")));
		out = new PrintStream(new BufferedOutputStream(new FileOutputStream("b_out.txt")));
		
		int n = in.nextInt() ; in.nextLine() ;
		int t = 1 ;
		while( n-- > 0)
			new B().solveProblem(t++);
		
		out.close();
	}

	static Scanner in = new Scanner(new InputStreamReader(System.in));
	static PrintStream out = new PrintStream(new BufferedOutputStream(System.out));
	

	//static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	
	
	public void solveProblem(int nr) {	
		out.print("Case #" + nr + ": " ) ;

		int N = in.nextInt() ;
		int S = in.nextInt() ;
		int p = in.nextInt() ;
		
		int[] v = new int[N] ;
		for( int i = 0 ; i < N ; i++ )
			v[i] = in.nextInt() ;
		
		int[] min_ns = new int[31] ;
		int[] min_s = new int[31] ;
		fill( min_s, -1 );
		
		for( int i = 0 ; i <= 10 ; i++ )
			for( int j = i ; j <= i + 2 && j <= 10 ; j++ )
				for( int k = j ; k <= i + 2  && k <= 10 ; k++ ){
					min_s[i+j+k]  = max(min_s[i+j+k],k ) ;
				}
		for( int i = 0 ; i <= 10 ; i++ )
			for( int j = i ; j <= i + 1 && j <= 10 ; j++ )
				for( int k = j ; k <= i + 1  && k <= 10 ; k++ ){
					min_ns[i+j+k]  = max(min_ns[i+j+k],k ) ;
				}
		int t1 = 0 ;
		int t2 = 0 ;
		
		for( int a : v ){
			
			if( min_ns[a] >= p )
				t1++ ;
			else if( min_s[a]  >= p )
				t2++ ;
			
		}
		
		out.println(t1+min(t2,S)) ;
		System.err.println("Case #" + nr + " solved") ;
	}
	

}