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.Scanner;


public class Solution {
	
	public static void main(String[] args)
	{
		Scanner s = new Scanner(System.in);
		int size = s.nextInt();
		for (int count = 1; count <= size; count++){
			int dancerNum = s.nextInt();
			int surpNum = s.nextInt();
			int score = s.nextInt();
			int[] dancerScore = new int[dancerNum];
			char[] marks = new char[dancerNum];
			for (int i = 0; i < dancerNum; i++){
				dancerScore[i] = s.nextInt();
			}
			
			int highB = score * 3 - 2;
			int lowB = (score - 1) * 3 - 1;
			int output = 0;
			int sup  = surpNum;
			int markIdx = 0;
			if (score < 2)
			{
				for (Integer i : dancerScore){
					if (i >= score)
					{
						marks[markIdx] = '+';
						output++;
					}else{
						marks[markIdx] = '-';
					}
					markIdx++;
				}
				
			}
			else
			{
				for (Integer i : dancerScore){
					if (i >= highB){
						output++;
						marks[markIdx] = '+';
					}else if (i< highB && i >= lowB && sup > 0){
						//if (){
						output++;
						sup--;
						marks[markIdx] = '*';
//						}else{
//							
//							marks[markIdx] = '-';
//						}
					}
					else{
						marks[markIdx] = '-';
					}
					markIdx++;
				}
			}
//			System.out.print("Case #"+count+": " + dancerNum + " " + surpNum + " "+ score + "		");
//			for (Integer i: dancerScore)
//			{
//				System.out.print(i+"	");
//			}
			System.out.println("Case #"+count+": "+output);
//			for (Character mark: marks)
//			{
//				System.out.print(mark+"	");
//			}
//			System.out.println();
		}
		
	}

}
