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


public class Run2
{
	public static void main(String[] args)
	{
		String path = "files/B-large.in";
		
		int T = 0;
		ArrayList<ArrayList<Integer>> googlers = new ArrayList<ArrayList<Integer>>();
		ArrayList<Integer> surprisings = new ArrayList<Integer>();
		ArrayList<Integer> leasts = new ArrayList<Integer>();
		
		try
		{
			boolean isFirstLine = true;
			
			FileReader FR = new FileReader(path);
			BufferedReader BR = new BufferedReader(FR);
			String str = "";
			
			while((str=BR.readLine())!=null)
			{
				if (isFirstLine)
				{
					T = Integer.parseInt(str);
					isFirstLine = false;
				}
				else
				{
					String[] temp = str.split(" ");
					
					surprisings.add(Integer.parseInt(temp[1]));
					leasts.add(Integer.parseInt(temp[2]));
					
					ArrayList<Integer> score = new ArrayList<Integer>();
					for(int i = 3; i < temp.length; i++)
					{
						score.add(Integer.parseInt(temp[i]));
					}
					googlers.add(score);
				}
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
		
		for(int i = 0; i < T; i++)
		{
			ArrayList<Integer> googler = googlers.get(i);
			int surprising = surprisings.get(i);
			int least = leasts.get(i);
			int number = 0;
			
			int dontSurprising = 0;
			int isSurprising = 0;
			for(int j = 0; j < googler.size(); j++)
			{
				int score = googler.get(j);
				
				int surprisingBounds = least+(least-2)*2;
				int dontSurprisingBounds = least+(least-1)*2;
				if (least < 2)
				{
					surprisingBounds = least;
					dontSurprisingBounds = least;
				}
				if (score >= surprisingBounds && score < dontSurprisingBounds)
				{
					isSurprising++;
				}
				else if (score >= dontSurprisingBounds)
				{
					dontSurprising++;
				}
			}
			number = dontSurprising+isSurprising+((surprising-isSurprising)>=0?0:(surprising-isSurprising));
			System.out.println("Case #"+(i+1)+": "+number);
		}
	}
}