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);
		
		
		
	}
}

package qualification_round;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class A_sl_Dansing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try {
			Scanner inp = new Scanner(new FileInputStream("A_s_input.txt"));
			int i=0,j=0,k=0,tc=0;
			int T = inp.nextInt();
			inp.nextLine();
			for(tc=0;tc<T;tc++){
				int N = inp.nextInt();
				int S = inp.nextInt();
				int P = inp.nextInt();
				int arr[] = new int[N];
				
				for(i=0;i<N;i++){
					arr[i] = inp.nextInt();
				}
				
				inp.nextLine();
				
				int arr1[] = new int[N];
				int arr2[] = new int[N];
				
				for(i=0;i<N;i++){
					arr1[i] = arr[i]/3;
					arr2[i] = arr[i] % 3;
				}
				
				int result = 0;
				for(i=0;i<N;i++){
					if(arr2[i] == 0){
						if(arr1[i] >= P){
							result++;
						}
						else if(arr1[i]+1 == P && arr1[i] != 0 && S>0){
							S--;
							result++;
						}
					}
					else if(arr2[i] == 1 && arr1[i]+1 >= P){
						result++;
					}
					else if(arr2[i] == 2){
						if(arr1[i]+1 >= P){
							result++;
						}
						else if(arr1[i]+2 == P && S>0){
							result++;
							S--;
						}
					}
				}
				
				k=tc+1;
				System.out.println("Case #" + k +": "+result);
				
			}
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

}
