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 QR_Bsmall {
	public static void main(String[] args) throws Exception{
		// Scanner sc = new Scanner(System.in);
		// PrintWriter pw = new PrintWriter(System.out);
		// Scanner sc = new Scanner(new FileReader("input.in"));
		// PrintWriter pw = new PrintWriter(new FileWriter("output.out"));
		Scanner sc = new Scanner(new FileReader("B-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-small-attempt0.out"));
		
		
		int T;
		
		int N, S, p;
		int[] t = new int[100];
		int ans;
		
		T = sc.nextInt();
		
		for(int times = 1; times <= T; times++){
			N = sc.nextInt();
			S = sc.nextInt();
			p = sc.nextInt();
			
			for(int i = 0; i < N; i++){
				t[i] = sc.nextInt();
			}
			
			ans = 0;
			
			for(int i = 0; i < N; i++){
				if(t[i] <= 1){
					if(p <= t[i]){
						ans++;
					}
					continue;
				}
				t[i] = t[i] - (p * 3);
				if(t[i] > -3){
					ans++;
				}else if(t[i] > -5 && S > 0){
					ans++;
					S--;
				}
			}
			
			System.out.print("Case #" + times + ": ");
			System.out.print(ans);
			System.out.println();
			
			
			pw.print("Case #" + times + ": ");
			pw.print(ans);
			pw.println();
			
		}
		
		sc.close();
		pw.close();
		
	}
}

