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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;


public class Dancers {
	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader(new File("B-small-attempt0.in")));
		BufferedWriter out = new BufferedWriter(new FileWriter(new File("output0")));
		
		String line = in.readLine();
		int T = Integer.parseInt(line);
		
		for(int i = 0; i < T && in.ready(); i++) {
			line = in.readLine();
			
			StringTokenizer tokenizer = new StringTokenizer(line);
			
			int N = Integer.parseInt(tokenizer.nextToken());
			int S = Integer.parseInt(tokenizer.nextToken());
			int p = Integer.parseInt(tokenizer.nextToken());
			
			int numReg = 0;
			int numSurprise = 0;
			
			int min = 3*p - 2;
			int max = 3*p + 2;
			int sMin = min - 2;
			int sMax = max + 2;
			
			for(int j = 0; j < N && tokenizer.hasMoreTokens(); j++) {
				int score = Integer.parseInt(tokenizer.nextToken());
				
				if (score == 0) {
					if (p == 0)
						numReg++;
					continue;
				}
				
				if (score == 1) {
					if (p <= 1)
						numReg++;
					continue;
				}
				
				if (score >= min) {
					numReg++;
					continue;
				}
				
				if (score >= sMin)
					numSurprise++;
			}
			
			numSurprise = Math.min(numSurprise, S);
			int num = numReg + numSurprise;
			
			System.out.println("Case #" + (i+1) + ": " + num + ", reg: " + numReg + ", surp: " + numSurprise);
			
			out.write("Case #" + (i+1) + ": " + num);
			out.newLine();
			
		}
		
		out.close();
	}
}
