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.util.*;
import java.io.*;
class DancingWithTheGooglers{
	Scanner input;
	PrintWriter output;
	StringBuilder answer = new StringBuilder();

	public static void main(String[] args){
		DancingWithTheGooglers app = new DancingWithTheGooglers();
		app.openInput(args[0]+".in");
		app.setOutput(args[0]+".out");
		app.solve();
		app.saveAndCloseOutput();
	}

	public void openInput(String filename){
		try{
			input = new Scanner(new File(filename));
		} catch (Exception e){
			e.printStackTrace();
		}
	}

	public void setOutput(String filename){
		try{
			output = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
		} catch (Exception e){
			e.printStackTrace();
		}
	}

	public void solve(){
		int nCase = input.nextInt();
		input.nextLine();
		int n,s,p;
		int count = 0;
		for(int i=1;i<=nCase;i++){
			n = input.nextInt();
			s = input.nextInt();
			p = input.nextInt();

			count = 0;
			for(int j=0;j<n;j++){
				int score = input.nextInt();
				switch(score%3){
					case 0:
						if(score/3>=p){count++;}
						else if(s>0 && score != 0 && score/3+1 == p){count++;s--;}
						break;
					case 1:
						if(score/3 + 1 >= p){count++;}
						break;
					case 2:
						if(score/3 + 1 >= p){count++;}
						else if(s>0 && score/3 + 2 == p){count++;s--;}
						break;
				}
			}
			output.println("Case #"+i+": "+count);
		}
	}

	public void saveAndCloseOutput(){
		output.close();
	}
}
