package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;


public class Dancers {
	public static void main (String args[]){
		if (args.length != 1){
			System.out.println ("Gimme the right arguments!");
			return;
		}
		File f = new File(args[0]);
		int testcases, surprise, p, n;
		ArrayList <Integer> scores = new ArrayList <Integer>();




		try{
			BufferedReader in = new BufferedReader (new FileReader(f));
			String s;
			testcases = Integer.parseInt(in.readLine());
			for (int i = 1; i<=testcases; i++){

				scores.clear();
				s = in.readLine();
				String temp [] = s.split(" ");
				n= Integer.parseInt (temp[0]);
				surprise = Integer.parseInt(temp[1]);
				p = Integer.parseInt(temp[2]);
				for (int j =3; j<temp.length; j++){
					scores.add(Integer.parseInt(temp[j]));
				}
				int count = 0;
				int countSpecial =0;
				for (int a : scores){
					boolean sp = true;
					boolean found = false;
					for (int q = p; q<=10; q++){
						int t = a - q;
						if(t >=0){
							int l = t/2;
							int h = t - l;
							if (Math.abs(q - l) <=2 && Math.abs(q - h) <=2){
								//	System.out.println(a + " " + + q + " " + t + " " + l + " " + h) ;
								if (Math.abs(q - l) <2 && (Math.abs(q - h) <2)){
									sp = false;	
									//		System.out.println("reg");
								}
								found = true;

							}
						}
					}

					if (found){
						count ++;
						if (sp){
							countSpecial++;
							//	System.out.println("hi");
						}
					}
				}
				//System.out.println(count + " " + countSpecial);
				if (countSpecial > surprise){
					count -= (countSpecial - surprise);
				}
				System.out.printf ("Case #%d: %d\n", i, count );
			}




		}

		catch (IOException e){

		}
	}

}
