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.*;

public class B{
	
	public static void main(String[] args) throws IOException{
		Scanner inp = new Scanner(new File("B-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("b.out"));
		
		int numCases = inp.nextInt();
		
		for (int cas = 0; cas < numCases; cas++){
			pw.print("Case #" + (cas+1) + ": ");
			
			/* case input */
			int N = inp.nextInt();
			int S = inp.nextInt();
			int p = inp.nextInt();
			int[] t = new int[N];
			for (int i = 0; i < N; i++){
				t[i] = inp.nextInt();
			}
			/* end case input */
			
			/* main logic */
			int ans = 0;
			
			int bNoS = 3*p - 2;
			if (bNoS < 0){
				bNoS = 0;
			}
			
			int bS = 3*p - 4;
			if (bS < 2){
				bS = 2;
			}
			
			for (int i = 0; i < N; i++){
				int ti = t[i];
				if (ti >= bNoS){
					ans++;
					continue;
				}
				else if (ti >= bS){
					if (S > 0){
						S--;
						ans++;
						continue;
					}
					else{
						continue;
					}
				}
				else{
					continue;
				}
			}
			
			pw.println(ans);
		}
		pw.close();
	}
}
