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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class B {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader br= new BufferedReader(new FileReader(args[0]));
		BufferedWriter bw= new BufferedWriter(new FileWriter(args[0]+".out"));
		String line= br.readLine();
		int cases= Integer.parseInt(line);
		for (int i= 0; i != cases; i++) {
			line= br.readLine();
			Scanner sc= new Scanner(line);
			List<Integer> list= new ArrayList<Integer>();
			while (sc.hasNextInt()) {
				int a= sc.nextInt();
				list.add(a);
			}
			int[] params= new int[list.size()];
			for (int j= 0; j != params.length; j++) {
				params[j]= list.get(j).intValue();
			}
			bw.write("Case #"+(i+1)+": "+max(params)+"\n");
		}
		br.close();
		bw.close();
	}
	
	public static int max(int[] params) {
		int n= params[0];
		int s= params[1];
		int p= params[2];
		
		int normal= 0;
		int surprising= 0;
		
		for (int i= 0; i != n; i++) {
			if ((params[3+i]+2)/3 >= p) normal++;
			else if ((params[3+i]+4)/3 >= p && params[3+i] >= 2) surprising++;
		}
		
		System.out.println(n+" "+s+" "+p);
		System.out.println(normal+" "+surprising);
		
		return normal + Math.min(surprising, s);
	}

}
