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.File;
import java.io.FileWriter;
import java.util.Scanner;


public class B {

	
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-small-attempt5.in"));
		FileWriter f = new FileWriter("B.out");
		int N,S,p;
		int googler;
		int kol,ost;
		int br;
		int T=sc.nextInt();
		
		for(int t=1;t<=T;t++){
			br=0;
			sc.nextLine();
			N=sc.nextInt();
			S=sc.nextInt();
			p=sc.nextInt();
			for(int i=0;i<N;i++){
				googler=sc.nextInt();
				kol=googler/3;
				ost=googler%3;
				
				if(kol>=p){
					br++;
					continue;
				}
				
				if(ost==0){
					if(kol+1>=p&&S>0&&kol-1>=0){
						S--;
						br++;
						
					}
					continue;
				}
				
				if(ost==1){
					if(kol+1>=p){
						br++;
						
					}
					continue;
				}
				//ost==2
				if(kol+1>=p){
					br++;
					continue;
				}
				if(kol+2>=p&&S>0){
					S--;
					br++;
				}
			}
			f.write("Case #"+t+": "+br+"\n");
		}
		
		f.close();
	}

}
