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.*;
import java.math.*;

public class Prac2 {
	public static void main(String[] arg){
		try{
			Scanner in=new Scanner(new File("sample"));
			//BufferedReader br=new BufferedReader(new FileReader("sample"));
			//int numCases=in.nextInt();//br.readLine();br.readLine();
		//	BufferedWriter bw=new BufferedWriter(new FileWriter("output.txt"));
			int numCases=in.nextInt();
			int counter=1;
			//in.nextLine();
			counter=1;
			while (counter!=numCases+1){
				int N=in.nextInt();
				int S=in.nextInt();
				int p=in.nextInt();
				int count=0;
				while (N!=0){
					int cur=in.nextInt();
					if (cur/3>p){
						int third=cur/3;
						int pair=cur-cur/3;
						if (Math.abs(third-pair/2)<=1){
							count++;
						}else{
							if (Math.abs(third-pair/2)==2 && S>0){
								S=S-1;
								count++;
							}
						}
					}else{
						int pair=cur-p;
						if (cur>=p && Math.abs(p-pair/2)<=1){
							count++;
						}else{
							if (Math.abs(p-pair/2)==2 && S>0){
								S=S-1;
								count++;
							}
						}
					}
					N=N-1;	
				}
				
				System.out.println("Case #"+counter+": "+count);
				
				counter++;
			}
		
		}catch (FileNotFoundException e){
			
		}catch (IOException e){
		}
	}
}