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

public class ProjB {
	static Scanner scan = new Scanner (System.in);
	
	static void test (int k ) {
		System.out.print ("Case #" + k + ": ");
		int N = scan.nextInt();
		int S = scan.nextInt();
		int p = scan.nextInt();
		int[] input = new int[N];
		for (int i = 0; i < N; ++i)
			input[i] = scan.nextInt();
		Arrays.sort(input);
		
		int min1 = (p >= 1)? 3*p-2:0;
		int min2 = -1;
		if (p >= 2)
			min2 = 3 * p - 4;
		else if (p == 1)
			min2 = 1;
		else
			min2 = 0;
		int k1 = N - 1;
		while (k1 >= 0 && input[k1] >= min1)
			--k1;
		int ans = N - 1 - k1;
		int k2 = k1;
		while (k2 >=0 && (k1 + 1 - k2) <= S && input[k2] >= min2)
			--k2;
		ans += k1 - k2;
		System.out.println (ans);
		
	}
	
	public static void main (String[] args) {
		int T = scan.nextInt();
		for (int i = 1; i <= T; ++i)
			test (i);
		
	}
}
