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.IOException;
import java.util.Scanner;


public class code12 {
    public static int nosurprise(int n){
    int p= (n/3);
     if(n%3==0){return p;}else{return (p+1);}}
    public static int surprise(int n){
    int p=(n/3);
    if(n%3==2){return (p+2);}else{
        if(n%3==1){return (p+1);}
        else{if(p-1>0){return (p+1);}else{return p;}}}} 
    
    public static int solution(int x, int[] p,int s){
    int sur=s; int ans=0;
    for(int k=0;k<p.length;k++){
    if(nosurprise(p[k])>=x){ans++;}
    else{
    if(sur>0){if(surprise(p[k])>=x){
    ans++;sur--;}else{}}else{}}
    }
    return ans;}
     public static void main(String[] args) throws IOException{
       Scanner c = new Scanner(System.in);
     int times=c.nextInt();
     for(int p=0;p<times;p++){
     int n=c.nextInt(); int surprise=c.nextInt(); int val=c.nextInt();
     int[] ci=new int[n];
     for(int g=0; g<n;g++){
     ci[g]=c.nextInt();}
     int answer= solution(val,ci,surprise);
     System.out.println("Case #"+(p+1)+":  "+answer);}
     }
}
