import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Solution {

	/**
	 * @param args
	 * @throws Exception 
	 */
	public static void doMain() throws Exception {

		Scanner sc = new Scanner(new FileReader("input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));

		int caseCnt = sc.nextInt();
		sc.nextLine();
		for (int caseNum = 0; caseNum < caseCnt; caseNum++) {
			pw.print("Case #" + (caseNum + 1) + ": ");
			//# googlers
			int n = sc.nextInt();
			//# surprising
			int s = sc.nextInt();
			//min score
			int p = sc.nextInt();
			
			ArrayList<Integer> scores = new ArrayList<Integer>(); 
			int res = 0; 
			for (int i = 0; i<n; i++) {
				scores.add(sc.nextInt());
			}
			
			int minNumberP = (p-2);
			if (minNumberP < 0) {
				minNumberP = 0;
			} 
			
			int minNumberNormal = p-1;
			if (minNumberNormal < 0) {
				minNumberNormal = 0;
			}
			
			int minSurprisingNumber = minNumberP*2+p;
			int minNumber = minNumberNormal*2+p;
			int sUsed = 0;
			for (int score : scores) {
				if (score>=minNumber) {
					res++;
				} else if (score>=minSurprisingNumber && sUsed < s) {
					res++;
					sUsed++;
				}
			}
			
			pw.println(res);
//			System.out.println(n+" "+s+" "+p+" ");
			
//			for (int score : scores) {
//				if (score>=minNumber) {
//					res++;
//				}
//			}
//			System.out.println("min score: "+minNumber);
		}


		pw.flush();
		pw.close();
		sc.close();
	}

	public static void main(String[] args) throws Exception {
//		System.out.println((int)'a');
		new Solution().doMain();
	}
}
