import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.*;
import java.util.*;

public class dancing {
	public static void main(String[] args)throws Exception{
		Scanner f = new Scanner(new File(args[0]));
		int count=0;//# tuples >= limit
		int res=0;	//mult result
		int rem=0;	//remainder
		int N=0;	//# tuples
		int S=0;	//# surprising tuples (t%r==2)
		int s=0;	//current count of surprising tuples
		int l=0;	//the limit
		int minT=0,maxT=10;	//minmum & maximum T values;
		ArrayList<Integer> al=new ArrayList<Integer>();	//list of tuples
		int C=0;	//# cases
		
		C = f.nextInt(); //get # of test cases
		for (int c=1;c<=C;c++){ //for each test case
			N=f.nextInt();S=f.nextInt();l=f.nextInt();//get params
			count=0;	//reset # good tuples count
			s=0;		//reset surprising tuple count
			al.clear();	//reset t list
			for(int i=1;i<=N;i++)al.add(f.nextInt());//build t list
			Collections.sort(al);	//sort lowest to highest
			Collections.reverse(al);//sort highest to lowest
			/*for (Integer x: al)System.out.print(x + " ");*/
			for (Integer t:al) {
				res=t/3; rem=t%3;
				if (res >= l)
					count++;
				else if (res == l-1)
					if (rem != 0)
						count++;
					else {// rem==0
						if (s<S && res>minT) {
							count++;
							s++;
						}
					}
				else if (res == l-2)
					if (rem == 2) {
						if (s < S) {
							count++;
							s++;
						}
					}
			}
			
			System.out.println("Case #"+c+": "+count);//display result
		}
	}
}