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.FileReader;
import java.io.FileWriter;
import java.io.PrintStream;
import java.io.PrintWriter;

public class Dancing {

	static PrintStream O = System.out;

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try {
			PrintWriter out = new PrintWriter(new FileWriter("b.out"));
			BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
			int cases = Integer.parseInt(in.readLine());
			for (int kase = 0; kase < cases; kase++){
				String input = in.readLine();
				String[] arr = input.split(" ");
				int N = Integer.parseInt(arr[0]);
				int S = Integer.parseInt(arr[1]);
				int p = Integer.parseInt(arr[2]);
				int[] t = new int [arr.length - 3];
				for (int i = 0; i < t.length; i++){
					t[i] = Integer.parseInt(arr[i + 3]);
				}
				
				int pastMax = 0;
				for (int i = 0; i < t.length; i++){
					if (findMax(t[i]) >= p){
						pastMax++;
					}else if (S > 0 && findSMax(t[i]) >= p){
						pastMax++;
						S--;
					}
				}
				out.println("Case #" + (kase + 1) + ": " + pastMax);
			}
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	static int findMax (int sum){
		if (sum == 0){
			return 0;
		}else if (sum == 1){
			return 1;
		}else if (sum == 2){
			return 1;
		}else if (sum == 3){
			return 1;
		}else if (sum == 4){
			return 2;
		}
		return (sum + 2) / 3;
	}
	
	static int findSMax (int sum){
		if (sum == 0){
			return 0;
		}else if (sum == 1){
			return 1;
		}else if (sum == 2){
			return 2;
		}else if (sum == 3){
			return 2;
		}else if (sum == 4){
			return 2;
		}else if (sum == 5){
			return 3;
		}
		return (sum + 4) / 3;
	}

}
