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

	   }
}

/*
 * Patrick Bonnell
 * Google Code Jam 2012
 * Qualification Round
 * Dancing With the Googlers
 */


import java.io.*;
import java.util.*;


public class DancingSolution
{
	String filename;
	Case[] cases;
	
	private class Case
	{
		int s, p;
		int totals[];
		
		public Case(int n, int s, int p)
		{
			totals = new int[n];
			this.s = s;
			this.p = p;
		}
		
		public boolean hasBestResult(int i, boolean canBeSurprising)
		{
			int currentBest = 10;
			int remainder, min, max;
			
			while(currentBest >= p)
			{
				remainder = totals[i] - currentBest;
				
				if(canBeSurprising)
				{
					if((currentBest - 2) > -1) min = currentBest - 2;
					else min = currentBest;
					
					if((currentBest + 2) < 11) max = currentBest + 2;
					else max = currentBest;
				}
				else
				{
					if((currentBest - 1) > -1) min = currentBest - 1;
					else min = currentBest;
					
					if((currentBest + 1) < 11) max = currentBest + 1;
					else max = currentBest;
				}
				
				if(remainder >= (min * 2) && remainder <= (max * 2)) return true;
				
				currentBest--;
			}
			
			return false;
		}
	}
	
	public DancingSolution(String filename) throws FileNotFoundException
	{
		this.filename = filename;
		Scanner sc = new Scanner(new File(filename));
		
		cases = new Case[sc.nextInt()];
		
		for(int i=0; i<cases.length; i++)
		{
			cases[i] = new Case(sc.nextInt(), sc.nextInt(), sc.nextInt());
			
			for(int j=0; j<cases[i].totals.length; j++)
				cases[i].totals[j] = sc.nextInt();
		}
	}
	
	public void solve() throws IOException
	{
		BufferedWriter out = new BufferedWriter(new FileWriter(new File(filename.replace("in", "out"))));
		for(int i=0; i<cases.length; i++)
			out.write("Case #"+(i+1)+": "+solveCase(i)+"\n");
		out.close();
	}
	
	private int solveCase(int n)
	{
		int withBestResult = 0;
		int suprisingResults = 0;
		
		for(int i=0; i<cases[n].totals.length; i++)
		{
			if(cases[n].hasBestResult(i, false))
				withBestResult++;
			else if(suprisingResults < cases[n].s && cases[n].hasBestResult(i, true))
			{
				withBestResult++;
				suprisingResults++;
			}
		}
		
		return withBestResult;
	}
	
	public static void main(String[] args)
	{
		System.out.print("Input file: ");
		try
		{
			DancingSolution sol = new DancingSolution(new Scanner(System.in).nextLine());
			System.out.println("Running...");
			sol.solve();
			System.out.println("Done.");
		}
		catch(IOException e)
		{
			System.err.println(e);
		}
	}
}
