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.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class GoogleDancers {
	
	public static void main(String[] args){
		
		try{
			// Open the file that is the first 
			// command line parameter
			FileInputStream fstream = new FileInputStream(args[0]);
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			//Read File Line By Line
			int numTest = Integer.parseInt(br.readLine());
			for(int i = 0; i < numTest; i ++){
				String str = br.readLine();
				String numbers[] = str.split(" ");
				int num = Integer.parseInt(numbers[0]);
				ArrayList<Integer> scoreIntegers = new ArrayList<Integer>();
				for(int sc = 3; sc < numbers.length; sc++){
					scoreIntegers.add(new Integer(numbers[sc]));
				}
				int surpriseScorers= Integer.parseInt(numbers[1]);
				int bestScore= Integer.parseInt(numbers[2]);
				int currentSurpriseScorers = 0;
				int currentBestScorers = 0;
				int answer = 0;
				ArrayList<JudgeScoreTuple> canBeTurnedToSurprise = new ArrayList<JudgeScoreTuple>();
				ArrayList<JudgeScoreTuple> canBeTurnedToBestScore = new ArrayList<JudgeScoreTuple>();
				
				ArrayList<JudgeScoreTuple> tupleScores = bestResult(scoreIntegers);
				for(JudgeScoreTuple tuple : tupleScores){
					JudgeScores jsNonSurprise = tuple.getNonSurprise();
					if(jsNonSurprise!=null){
						if(jsNonSurprise.getMaxScore() >= bestScore){
							currentBestScorers ++;
							if(tuple.getSurprise()!=null){
								canBeTurnedToSurprise.add(tuple);
							}
						}
					}
					else{
						if(tuple.getSurprise().getMaxScore() >= bestScore){
							currentBestScorers++;
						}
						currentSurpriseScorers++;
					}
					if(!canBeTurnedToSurprise.contains(tuple)){
						JudgeScores jsSurprise = tuple.getSurprise();
						if(jsSurprise!=null){
							if(jsSurprise.getMaxScore()>=bestScore){
								canBeTurnedToBestScore.add(tuple);
							}
						}
					}
					
				}
				
				if(currentSurpriseScorers == surpriseScorers){
					answer = currentBestScorers;
				}
				
				
				if(currentSurpriseScorers < surpriseScorers){
					answer = currentBestScorers + Math.min(surpriseScorers, canBeTurnedToBestScore.size());
				}
				
				int x = i + 1;
				System.out.println("Case #" + x + ": " + answer);
				
				
			}
			//Close the input stream
			in.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
		
		
	}
	
	public static ArrayList<JudgeScoreTuple> bestResult(ArrayList<Integer> scoreIntegers){
		ArrayList<JudgeScoreTuple> possibleJudgeScores = new ArrayList<JudgeScoreTuple>();
		for(Integer i : scoreIntegers){
			int sumJudgeScore = i.intValue();
			JudgeScores jc1 = null; 
			JudgeScores jc2 = null;
			if(sumJudgeScore % 3 == 0){
				jc1 = new JudgeScores(sumJudgeScore/3, sumJudgeScore/3, sumJudgeScore/3);
				if(sumJudgeScore/3 + -1 >=0 && sumJudgeScore/3 + 1 <= 10)
					jc2 = new JudgeScores(sumJudgeScore/3 -1 , sumJudgeScore/3, sumJudgeScore/3 + 1, true);
			}
			if(sumJudgeScore % 3 == 1){
				if(sumJudgeScore/3 + 1 <= 10){
					jc1 = new JudgeScores(sumJudgeScore/3, sumJudgeScore/3, sumJudgeScore/3 + 1);
				if(sumJudgeScore/3 + -1 >=0)
					jc2 = new JudgeScores(sumJudgeScore/3 +1 , sumJudgeScore/3 + 1, sumJudgeScore/3 -1, true);
				}
			}
			if(sumJudgeScore % 3 == 2){
				if(sumJudgeScore/3 + 1 <= 10)
					jc1 = new JudgeScores(sumJudgeScore/3 +1 , sumJudgeScore/3 + 1, sumJudgeScore/3 );
				if(sumJudgeScore/3 + 2 <= 10)
					jc2 = new JudgeScores(sumJudgeScore/3, sumJudgeScore/3, sumJudgeScore/3 + 2, true);
				
			}
			possibleJudgeScores.add(new JudgeScoreTuple(jc1, jc2));
		}
		
		return possibleJudgeScores;
	}
	
	
}

