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

public class Dancing {
	
	static int N, S, p;
	static int[] t;
	
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader("dancing.in"));
		int tc = Integer.parseInt(reader.readLine());
		String line;
		StringTokenizer st;
		for (int c = 1; c <= tc; c++) {
			line = reader.readLine();
			st = new StringTokenizer(line);
			N = Integer.parseInt(st.nextToken());
			S = Integer.parseInt(st.nextToken());
			p = Integer.parseInt(st.nextToken());
			t = new int[N];
			for (int i = 0; i < N; i++) {
				t[i] = Integer.parseInt(st.nextToken());
			}
			System.out.println("Case #"+c+": "+solve());
		}
	}

	static int solve(){
		boolean[] puedeSolo = new boolean[N];
		for (int i = 0; i < N; i++) {
			int k = t[i]/3;
			if (t[i]%3==0 && k>=p) puedeSolo[i]=true;
			if (t[i]%3!=0 && k+1>=p) puedeSolo[i]=true;
		}

		boolean[] puedeSorpresa= new boolean[N];
		for (int i = 0; i < N; i++) {
			int k = t[i]/3;
			if (t[i]%3==2 && k+2>=p) puedeSorpresa[i]=true;
			if (t[i]>=2 && t[i]%3<2 && k+1>=p) puedeSorpresa[i]=true;
		}
		
		int cps = 0;
		for (int i = 0; i < N; i++) {
			if (puedeSolo[i]) cps++;
		}
		
		int cpsor = 0;
		for (int i = 0; i < N; i++) {
			if (!puedeSolo[i] && puedeSorpresa[i]) cpsor++;
		}
		
		return Math.min(cps+cpsor, cps + S);
	}
	
}
