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.IOException;
import java.io.InputStreamReader;


public class B {
	
	private static boolean isValid(int val) {
		int[] invalids = new int[] { 0,1,4,7,10,13,16,19,22,25,28 };
		for(int i = 0; i < invalids.length; i++) {
			if(invalids[i] == val) return false;
		}
		return true;
	}
	
	public static void main(String[] args) {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		int t = -1;
		
		int[] maxValue = new int[31];
		for(int i = 0; i < maxValue.length; i++) {
			maxValue[i] = (int)Math.ceil((double)i / 3.0);
		}
		try {
			t = Integer.parseInt(reader.readLine());
			for(int j = 0; j < t; j++) {
				
				String[] line = reader.readLine().split(" ");
				int n = Integer.parseInt(line[0]);
				int s = Integer.parseInt(line[1]);
				int p = Integer.parseInt(line[2]);
				
				int count = 0;
				for(int i = 0; i < n; i++) {
					int total = Integer.parseInt(line[3 + i]);
					int max = maxValue[total];
					if(max >= p) {
						count++;
					}
					else {
						if(s > 0 && isValid(total) && ((max + 1) == p)) {
							count++;
							s--;
						}
					}
				}
				System.out.println("Case #" + (j+1) + ": " + count);
			}
			
		}
		catch(IOException e) {}
	}
}
