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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class DancingWithGoogler {

	private static FileReader freader;
	private static BufferedReader buffreader;
	private static FileWriter fwriter;
	private static BufferedWriter buffwriter;
	
	
	public static void main(String[] args) throws IOException {
		
		freader = new FileReader("B-large.in");
		buffreader = new BufferedReader(freader);
		fwriter= new FileWriter("result-large.txt");
		buffwriter = new BufferedWriter(fwriter);
		String str = null;
		int linenum = 0;
		int i=1;
		while((str=buffreader.readLine())!=null){
			if(i==1)
				linenum=Integer.parseInt(str);
			else{
				int arrSize = Integer.parseInt(str.split(" ")[0]);
				int num = Integer.parseInt(str.split(" ")[1]);
				int p = Integer.parseInt(str.split(" ")[2]);
				int[] scores = new int[arrSize];
				for(int j=0; j<arrSize; j++){
					scores[j]= Integer.parseInt(str.split(" ")[j+3]);
				}
				int count = getMostNum(p,num,scores);
				String finalStr = "Case #"+Integer.toString(i-1)+": "+Integer.toString(count)+"\n";
				buffwriter.write(finalStr);
			}
			i++;
			
		}
		
		/*int num = 1;
		int p = 1;
		int[] scores = {8, 0};*/
		//System.out.println(getMostNum(p,num,scores));
		
		buffwriter.close();
		fwriter.close();
		buffreader.close();
		freader.close();

	}
	
	public static int getMostNum(int p, int num, int[] scores){
		if(p==0)
			return scores.length;
		else if(p==1){
			int val1 = 1;
			int count = 0;
			for(int i=0; i<scores.length; i++){
				if(scores[i]>=val1){
					count++;
				}
			}
			//System.out.println(num);
			return count;
		}
		else{
			int count=0;
			int val1 = 3*p-2;
			int val2 = 3*p-4;
			for(int i=0; i<scores.length; i++){
				if(scores[i]>=val1){
					count++;
				}
				else if(scores[i]<val1 && scores[i]>=val2){
					if(num>0){
						count++;
						num--;
					}
				}
			}
			return count;
		}
		
	}

}
