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();

	   }
}

/**
 * KSpokas: GCJ 2012 Qualification Round Problem B
 */

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;


public class qualProblemB {
	private final static int EXPECTED_ARG_COUNT = 1;
	private static Map<Integer, Integer> lookup = new HashMap<Integer, Integer>();
	private static Map<Integer, Integer> surprisingLookup = new HashMap<Integer, Integer>();
	
	public static void main(String[] args) {
		if (args.length != EXPECTED_ARG_COUNT) {
			System.err.println("Error: expecting " + EXPECTED_ARG_COUNT);
			return;
		}
		buildLookups();
		
		String fileName = args[0];
		try {
		    FileInputStream fstream = new FileInputStream(fileName);
		    DataInputStream in = new DataInputStream(fstream);
		    BufferedReader br = new BufferedReader(new InputStreamReader(in));
		    BufferedWriter out = new BufferedWriter(new FileWriter(fileName + ".out"));
		    
		    Integer testCaseCount = Integer.parseInt(br.readLine());
		    
		    for (int i = 0; i < testCaseCount; i++) {
		    	String strLine = br.readLine();
		    	
		    	StringBuilder sb = new StringBuilder("Case #");
		    	sb.append(i + 1).append(": ");
		    	sb.append(calculate(strLine));
		    	out.write(sb.toString());
		    	out.newLine();
		    }
		    in.close();
		    out.close();
	    } catch (Exception e) {
	    	System.err.println("Error: " + e.getMessage());
	    }
	}
	
	private static int calculate(String input) {
		int maxValue = 0;
		
		String[] values = input.split(" ");
		Integer dancerCount = Integer.parseInt(values[0]);
		Integer surprisingCount = Integer.parseInt(values[1]);
		Integer targetScore = Integer.parseInt(values[2]);
		
		for (int i = 3; i < dancerCount + 3; i++) {
			Integer dancerTotal = Integer.parseInt(values[i]);
			
			if (dancerTotal >= lookup.get(targetScore)) {
				maxValue++;
			} else if (surprisingCount > 0 && dancerTotal >= surprisingLookup.get(targetScore)) {
				maxValue++;
				surprisingCount--;
			}
		}
		return maxValue;
	}
	
	private static void buildLookups() {
		for (int i = 0; i <= 10; i++) {
			lookup.put(i, getPossibleScores(i));
			surprisingLookup.put(i, getPossibleSurprisingScores(i));
		}
	}
	
	private static Integer getPossibleScores(Integer i) {
		Set<Integer> scoreSet = new HashSet<Integer>();
		
		if (i == 0) {
			scoreSet.add(0);
		} else {
			scoreSet.addAll(getScores(i - 1, i));
			scoreSet.addAll(getScores(i, i + 1));
			scoreSet.add(3 * i);
		}
		return Collections.min(scoreSet);
	}
	
	private static Integer getPossibleSurprisingScores(Integer i) {
		Set<Integer> scoreSet = new HashSet<Integer>();
		
		if (i == 0) {
			scoreSet.add(0);
		} else {
			scoreSet.addAll(getScores(i - 2, i));
			scoreSet.addAll(getScores(i, i + 2));
			
			if ((i - 2) >= 0) {
				scoreSet.add((i - 2) + (i - 1) + i);
			}
			
			if (i - 1 >= 0 && i + 1 <= 10) {
				scoreSet.add((i - 1) + i + (i + 1));
			}
			
			if (i + 2 <= 10) {
				scoreSet.add(i + (i + 1) + (i + 2));
			}
		}
		
		return Collections.min(scoreSet);
	}
	
	private static Set<Integer> getScores(Integer min, Integer max) {
		Set<Integer> scores = new HashSet<Integer>();
		
		if (min >= 0 && max <= 10) {
			scores.add((2 * min) + max);
		}
		return scores;
	}
	
}
