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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;

import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;

/** Main function is "solve" **/
public class CodeJamProblem2 {

		static HashMap<String,String> mappings=null;
		public static void main(String args[])
		{				
			solve();
		}

		private static void solve() {
				readFromInputAndWriteInOutput();			
		}

		private static void readFromInputAndWriteInOutput() {
			try {
				File f = new File("B-large.in");
				FileReader fileReader = new FileReader(f);
				BufferedReader buff = new BufferedReader(fileReader);
				String totalTestCases = buff.readLine();
				PrintWriter printWriter = new PrintWriter("B-large.out");
				int testCases = Integer.parseInt(totalTestCases);
				for(int i =1;i<=testCases;i++)
				{
					
					String line =  buff.readLine();
					String outputLine = "Case #"+i+": ";
					String result = solveForThisLine(line);
					outputLine = outputLine.concat(result);			
					printWriter.println(outputLine);
					//System.out.println(outputLine);
				}
				printWriter.close();
				
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			catch (Exception e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		
		}

		private static String solveForThisLine(String line) {
			
			String splitS[] = line.split(" ");
			int numberOfGooglers = Integer.parseInt(splitS[0]);
			int numberOfSurprisingScores = Integer.parseInt(splitS[1]);
			int reqP = Integer.parseInt(splitS[2]);
			int result = 0;
			int number=0;
			int quo = 0;
			int rem = 0;
			for(int i = 3;i<splitS.length;i++)
			{
				number =Integer.parseInt(splitS[i]);
				if(number==0 && reqP==0)
				{
					
					result=result+1;
					continue;
				}
				if(number ==0 )
					continue;
				quo = number/3;
				rem = number%3;
				rem = rem==0? 0 : 1;
				if(quo>=reqP || (rem+quo)>=reqP)
				{
					result=result+1;
					continue;
				}
				else 
				{
					if(numberOfSurprisingScores>=1)
					{
						number +=2;
						quo = number/3;
						rem = number%3;
						rem = rem==0? 0 : 1;
						if(quo>=reqP || (rem+quo)>=reqP)
						{
							result=result+1;
							numberOfSurprisingScores=numberOfSurprisingScores-1;
							continue;
						}
					
					}
						
				}
			}
			return result+"";
		}
}
