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.util.StringTokenizer;


public class B {

	public int solve(String input){
		int result=0;
		StringTokenizer st=new StringTokenizer(input, " \n");
		int n=Integer.parseInt(st.nextToken());
		int s=Integer.parseInt(st.nextToken());
		int p=Integer.parseInt(st.nextToken());
		int maxThres=0;
		int minThres=0;
		if(p>1){		
		 maxThres=(p-1)*3+1;
		 minThres=(p-2)*3+2;
		}else{
			maxThres=p;
			minThres=p;
		}
		while(st.hasMoreTokens()){
			int num=Integer.parseInt(st.nextToken());
			if(num>=maxThres){
				result++;
				continue;
			}
			if(num>=minThres && num<maxThres && s>0){
				result++;
				s--;
			}
		}
		
		return result;
	}
	public static void main(String[] args) {
		IOHelper io=new IOHelper("C:\\skill\\workspace\\cj2012\\src\\B-small-attempt1.in",
		"C:\\skill\\workspace\\cj2012\\src\\B-small-attempt1.out");
		int countOfTest=Integer.parseInt(io.readLine());
		B b=new B();
		for(int i=0;i<countOfTest;i++){
			String s=io.readLine();
			int solution= b.solve(s);
			String output="Case #"+(i+1)+": "+solution;
			io.writeLine(output);
		}
		

	}

}
