/**
 * 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.util.*;
import static java.lang.System.*;

public class B {
	public static void main (String [] args) throws IOException {new B().run();}
	public void run() throws IOException{
		Scanner file = new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B.out")));
		int times = Integer.parseInt(file.nextLine());
		for(int asdf = 0; asdf<times; asdf++){
			int n = file.nextInt();
			int s = file.nextInt();
			int p = file.nextInt();
			int[] ar = new int[n];
			for(int i = 0; i<n; i++)
				ar[i] = file.nextInt();
			Arrays.sort(ar);
			int count = 0;
			for(int i = n-1; i>=0; i--){
				int x = ar[i];
				int m1 = pos(x,false);
				int m2 = pos(x,true);
				if( m1 >= p ) count++;
				else if( m2 >= p && s>0 ){
					count++;
					s--;
				}
			}
			out.println ("Case #"+(asdf+1)+": "+count);
		}
		out.close();
		System.exit(0);
	}
	public int pos(int x, boolean s){
		int div = (int)Math.ceil(x/3.);
		int max = 0;
		for(int a = Math.max(0,div-2); a<div+2; a++)
		for(int b = Math.max(0,div-2); b<div+2; b++)
		for(int c = Math.max(0,div-2); c<div+2; c++){
			int dif = Math.max(Math.max(a,b),c)-Math.min(Math.min(a,b),c);
			if( dif >2 || a+b+c!=x || (!s&& dif==2))continue;
			max = Math.max(Math.max(a,b),Math.max(max,c));
		}
		return max;
	}
}