import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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){

		}
	}

}
