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.*;
public class DancingWithTheGooglers {

	public static void main(String[] args)throws IOException {
		BufferedReader bfr = new BufferedReader(
				new InputStreamReader(System.in));
		PrintWriter pr = new PrintWriter(System.out);
		int n = Integer.parseInt(bfr.readLine());
		for (int i = 1 ;i<=n;i++){
			String input []= bfr.readLine().split(" ");
			int googlers = Integer.parseInt(input[0]);
			int surprise = Integer.parseInt(input[1]);
			int max = Integer.parseInt(input[2]);
			int happens =0;
			for (int j =0;j<googlers;j++){
				int googler = Integer.parseInt(input[j+3]);
				int score[] ={(int)(googler/3),((double)googler/3==(int)googler/3)?(int)googler/3:(int)(googler/3)+1,(int) (googler-(Math.floor(googler/3)+(((double)googler/3==(int)googler/3)?(int)googler/3:(int)(googler/3)+1)))};
				if (score[0]>=max||score[1]>=max||score[2]>=max)
					happens++;
				else if (score[0]==score[2]){
					if(score[0]+1>=max&&score[0]-1>=0)
						if (surprise>0){
						happens++;
						surprise--;
						}
				}else if (score[1]==score[2]&&score[0]-1>=0){
					if(score[1]+1>=max)
						if (surprise>0){
						happens++;
						surprise--;
						}
				}
				
			}
			pr.printf("Case #%d: %d\n", i,happens);
			pr.flush();
		}

	}

}
