import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

import util.MyUtil;


public class ProblemB {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws Exception {
		String title = "B-small-attempt0.in";

		BufferedReader reader = MyUtil.getReader(title);
		int caseNumber = Integer.parseInt(reader.readLine());
		BufferedWriter writer = MyUtil.getWriter(title);
		
		for (int i = 0 ; i < caseNumber; i++){
			String line = reader.readLine();
			String result = subRoutine(line);
			
			writer.write("Case #" + (i + 1) + ": " + result + "\n");
			System.out.println("Case #" + (i + 1) + ": " + result);
		}
		
		writer.flush();

	}
	
	private static String subRoutine(String line){
		StringBuilder sb = new StringBuilder();
		String[] elements = line.split(" ");
		
		// The first integer will be N, the number of Googlers. 
		long N = Long.parseLong(elements[0]);
		// the second integer will be S, the number of surprising triplets of scores
		long B = Long.parseLong(elements[1]);
		// The third integer will be p, a best result of at least p
		long P = Long.parseLong(elements[2]);
		
		long count = 0;
		for (int i = 3 ; i < elements.length; i++){
			long total = Long.parseLong(elements[i]);
			long ok1 = Math.min(1, total);
			long ok2 = Math.min(2, total);
			long remains = total - P;
			long least = P - ok1;
			long doubleLeast = least * 2;
			if (remains >= doubleLeast ){
				count ++;
			}
			else if (remains + ok2 >= doubleLeast  && B > 0){
				count++;
				B--;
			}
			
		}
		
		sb.append(count);
		return sb.toString();
	}
}
