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.*;

public class Dancing{
	
	public static void main(String args[]){
		
		try{
			
			FileInputStream fstream = new FileInputStream(args[0]);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			
			PrintWriter out = new PrintWriter(args[0] + "_out");
			
			String strLine = br.readLine();
			int cases = Integer.parseInt(strLine);
				
			for (int i = 0; i < cases; i++){
				
				strLine = br.readLine();
				String[] this_literals = strLine.split(" ");
				int[] this_line = new int[this_literals.length];
				for (int j = 0; j < this_literals.length; j++) this_line[j] = Integer.parseInt(this_literals[j]);
				
				int number_of_googlers = this_line[0];
				int number_of_surprises = this_line[1];
				int best_result = this_line[2];
				
				int candidates = 0;
				
				for (int googler = 0; googler < number_of_googlers; googler++){
					
					int unsurprising = 0;
					int surprising = 0;
					
					for (int score1 = 0; score1 <= 10; score1++){
						for (int score2 = 0; score2 <= 10; score2++){
							for (int score3 = 0; score3 <= 10; score3++){
								
								if (score1 + score2 + score3 == this_line[googler+3] &&
									score1 - score2 < 2 && score1 - score2 > -2 &&
									score2 - score3 < 2 && score2 - score3 > -2 &&
									score1 - score3 < 2 && score1 - score3 > -2){ 
									System.out.println("case " + i + " googler " + googler + " score1 " + score1 + " score2 " + score2 + " score3 " + score3);
									if (Math.max(score1,Math.max(score2,score3)) >= best_result) unsurprising++;
									}
									
								if (score1 + score2 + score3 == this_line[googler+3] &&(
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									score2 - score3 < 2 && score2 - score3 > -2 &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									score2 - score3 < 2 && score2 - score3 > -2&&
									(score1 - score3 == 2 | score1 - score3 == -2)))
									
									|
									
									(
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									(score1 - score3 == 2 | score1 - score3 == -2))
									|
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									score2 - score3 < 2 && score2 - score3 > -2&&
									(score1 - score3 == 2 | score1 - score3 == -2)))){ 
									System.out.println("case " + i + " googler " + googler + " score1 " + score1 + " score2 " + score2 + " score3 " + score3 + "(*)");
									if (Math.max(score1,Math.max(score2,score3)) >= best_result) surprising++;
									}
									
								
							}
						}
					}
					
					if (unsurprising > 0) candidates++;
					else if (surprising > 0 && number_of_surprises > 0){
						candidates++;
						number_of_surprises--;
					}
					
				}
				
				out.println("Case #" + (i+1) + ": " + candidates);
				
				}
				
			
		
			in.close();
			out.close();
			
		}
		
		catch (Exception e){
			System.err.println("Error: " + e.getMessage());
		}
		
	}
		
}
	
