package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.util.*;
import java.io.*;

public class B {
	public static int solve(int T, int P) {
		int[] score = new int[3];
		
		score[0] = T/3;
		score[1] = (T-score[0]) / 2;
		score[2] = (T-score[0]-score[1]);
		
		Arrays.sort(score);
		int dif = score[2] - score[0];
		
		if (dif > 2) {
			System.err.println("ERROR");
			System.exit(-1);
		}
		//System.err.println("BEFORE ARRANGE NUM "+T+": "+score[0]+" "+score[1]+" "+score[2]);
		
		if (score[2] >= P) {
			if (dif == 2) return 1;
			else return 0;
		}
		
		// try to make it interesting
		if (dif < 2) {
			score[2]++;
			score[1]--;
			Arrays.sort(score);
			dif = score[2] - score[0];
		}
		
		if (score[0] < 0 || score[0] > 10 || score[1] < 0 || score[1] > 10 || score[2] < 0 || score[2] > 10 || dif > 2) {
			return -1;
		}
		
		//System.err.println("AFTER ARRANGE NUM "+T+": "+score[0]+" "+score[1]+" "+score[2]);
		
		if (score[2] >= P) {
			if (dif == 2) return 1;
			else return 0;
		}
		
		return -1;
	}
	
	public static void main(String[] args) throws Exception{
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		int N, S, P, used, can;
		
		for(int caseNo = 1;caseNo <= T; caseNo++) {
			N = in.nextInt();
			S = in.nextInt();
			P = in.nextInt();
			used = 0;
			can = 0;
			
			for(int i=0;i<N;i++) {
				int ret = solve(in.nextInt(), P);
				
				if (ret == 0) { // didint need surprise
					can++;
				} else if (ret == 1 && used < S) { // need surprise
					used++;
					can++;
				}
			}
			System.out.println("Case #"+caseNo+": "+can);
			
		}
	}
}