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


class ProblemB {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt(), I = 0;
		while (T --> 0) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int[] scores = new int[N];
			for (int i = 0; i < N; ++i)
				scores[i] = in.nextInt();
			
			int result = 0;
			
			// Sort inputs
			Arrays.sort(scores);
			// Check [n/3]. If >= p, add to result and set to ignore in next phase
			for (int i = 0; i < scores.length; ++i)
				if ((scores[i]+2)/3 >= p) {
					++result;
					scores[i] = -10;
				}
			
			for (int i = scores.length - 1; i >= 0 && S > 0; --i) {
				if (scores[i] < 2) {
					if (scores[i] >= p) {
						++result;
						--S;
					}
				}
				else if ((scores[i]-2)/3 + 2 >= p) {
					++result;
					--S;
				}
			}
			
			System.out.printf("Case #%d: %d\n", ++I, result);
		}
	}
}
