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

public class q2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		File file = new File("C:/Users/Raja/workspace/GCJ/src/in.txt");
		
		
		int N,S,p;
		int[] sums;
		int norm,surp,ans;
		
		try{
			Scanner s = new Scanner(file);
			int num = Integer.parseInt(s.nextLine());
			for (int i = 0;i<num;i++){
				norm = 0;
				surp = 0;
				N = s.nextInt();
				S = s.nextInt();
				p = s.nextInt();
				sums = new int[N];
				for (int j = 0; j < N; j++){
					sums[j] = s.nextInt();
				}
				Arrays.sort(sums);
				for (int j = 0; j < N; j++){
					if (sums[j] >= 3*p-2)
						norm++;
					else if (sums[j] >= 3*p-4 && sums[j] > 1)
						surp++;
				}
				if (surp > S)
					ans = norm + S;
				else
					ans = norm + surp;
				
				System.out.println("Case #"+(i+1)+": "+ans);
			}
		}
		catch (FileNotFoundException e){
			e.printStackTrace();
		}

	}

}
