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


public class DancingWithTheGooglers {
	public static void main(String args[]){
		try {
			Scanner scanner = new Scanner(new File("B-small-attempt0.in"));
			int noOfCase = scanner.nextInt();
			scanner.nextLine();
//			System.out.println(noOfCase);
			String [] cases = new String [noOfCase];
			int counter=0;
			while(scanner.hasNextLine()){
				cases[counter] = scanner.nextLine();
//				System.out.println(cases[counter]);
				counter++;
			}
			
			for(int i =0 ;i<noOfCase;i++){
				System.out.println("Case #"+(i+1)+": "+processInt(cases[i]));
			
			}
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	private static int processInt(String caseString){
		Scanner processer = new Scanner(caseString);
		int noOfPeople = processer.nextInt();
		int noOfSuprise = processer.nextInt();
		int leastScore = processer.nextInt();
		
		int [] scoreOfPeople = new int [noOfPeople] ;
		int counter=0;
		while(processer.hasNextInt()){
			scoreOfPeople [counter]=processer.nextInt();
//			System.out.print(scoreOfPeople [counter]+" ");
			counter++;
		}
		
		int leastScoreCounter = 0; 
		int superisingCounter = 0; 
		
		for(int i =0; i<noOfPeople;i++){
			int averageScore= scoreOfPeople [i]/3;
			int extraScore = scoreOfPeople [i]%3;
			int diff = (leastScore-averageScore);
//			System.out.println(scoreOfPeople [i]+" "+averageScore+" "+extraScore+" "+diff+" "+superisingCounter+" "+noOfSuprise+" "+leastScoreCounter);
			if (scoreOfPeople[i] > 0) {
				if (extraScore == 0) {
					if (superisingCounter < noOfSuprise) {
						if (diff == 1) {
							leastScoreCounter++;
							superisingCounter++;
						}
					}
					if (diff < 1) {
						leastScoreCounter++;
					} else {

					}

				} else if (extraScore == 1) {

					if (diff <= 1) {
						leastScoreCounter++;
					} else {

					}

				} else {
					// extraScore ==2
					if (superisingCounter < noOfSuprise) {
						if (diff == 2) {
							leastScoreCounter++;
							superisingCounter++;
						}
					}

					if (diff <= 1) {
						leastScoreCounter++;
					}
				}
			} else if (scoreOfPeople[i] == 0) {
				if(diff ==0 ){
					leastScoreCounter++;
				}
			}
		}
		
		
//		System.out.println();
		
		return leastScoreCounter;
	}
}
