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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.StringTokenizer;






public class B { 

	static String inner = "input.in";
	static Scanner scan;
	public static void main (String[]args) throws IOException
	{
		File f = new File (inner);
		File out = new File("output.out");
		FileWriter wr; 
		wr = new FileWriter(out); 
		scan = new Scanner(f); 
		int test = scan.nextInt();
		scan.nextLine();
		for(int i = 0 ; i < test ; i++)
		{
			Scanner sc = new Scanner (scan.nextLine());
			int n = sc.nextInt();
			int surp = sc.nextInt();
			int p = sc.nextInt();
			int [] ggs = new int[n];
			for(int j = 0 ;j < n ; j++)
				ggs[j] = sc.nextInt();  
			String ret = "Case #"+ (i+1)+": ";
			 
			int zero =0;
			int one = 0;
			int twolow = 0;
			int lowhigh = 0;
			int high  = 0;
			int top = 0;
			for(int j = 0 ;j < n ; j++)
			{
				if(ggs[j] == 0)
					zero++;
				else if(ggs[j]<2)
					one++;
				else if(ggs[j]< 3*p-4)
					twolow++;
				else if(ggs[j] < 3*p-2)
					lowhigh++;
				else if(ggs[j]< 29)
					high++;
				else
					top++; 
			}
			if(p == 0)
				ret += ""+n;
			else if(p == 1 )
				ret += ""+ (n-zero);
			else
				ret += (Math.min(surp,lowhigh ) + high + top)+"";  
			wr.write(ret+"\n");
			
		}
		
		
		
		 
		 wr.flush();
	}
}
