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


public class Main {
	public static void main(String[] args) {
		Scanner r = new Scanner(System.in);
		
		int T = r.nextInt();
		int caseNumber = 1;
		while(T-- > 0){
			int N = r.nextInt();
			int S = r.nextInt();
			int P = r.nextInt();
			
			int[] a = new int[N];
			for(int i = 0; i < N; i++)
				a[i] = r.nextInt();
			
			Arrays.sort(a);
			
			int ret = 0;
			for(int i = N - 1; i >= 0; i--){
				boolean need = true;
				for(int x = 0; x <= 10; x++)
				for(int y = 0; y <= 10; y++){
					int z = a[i] - x - y;
					if(z > 10 || z < 0)continue;
					
					int max = Math.max(x, Math.max(y, z));
					if(max >= P && (Math.abs(x - y) <= 1 && Math.abs(x - z) <= 1 && Math.abs(y - z) <= 1)){
						need = false;
					}
				}
				
				if(!need)ret++;
				else{
					if(S > 0){
						boolean can = false;
						
						for(int x = 0; x <= 10; x++)
						for(int y = 0; y <= 10; y++){
							int z = a[i] - x - y;
							if(z > 10 || z < 0)continue;
							
							int max = Math.max(x, Math.max(y, z));
							if(max >= P && (Math.abs(x - y) <= 2 && Math.abs(x - z) <= 2 && Math.abs(y - z) <= 2)){
								can = true;
							}
						}
						
						if(can){
							S--;
							ret++;
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", caseNumber++, ret);
		}
	}
}
