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.*;



public class DancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int T = 0;
		int N = 0;
		int S = 0;
		int p = 0;
		int ptr = 0;
		int maxCount = 0;
		int scoreSum = 0;
		int score1 = 0;
		int score2 = 0;
		int score3 = 0;
		String currentCase = null;
		String inputFilename = "B-large.in";
		String outputFilename = "B-large.out";
		
		BufferedWriter out = null;
		try {
			out = new BufferedWriter(new FileWriter(outputFilename));
		} catch (IOException e2) {
			// TODO Auto-generated catch block
			e2.printStackTrace();
		}
		
		FileInputStream fStream = null;
		try {
			fStream = new FileInputStream(inputFilename);
		} catch (FileNotFoundException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		DataInputStream in = new DataInputStream(fStream);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		
		
		try {
			T = Integer.parseInt(br.readLine());
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		
		for(int i=0;i<T;i++) {
			try {
				currentCase = br.readLine();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			maxCount = 0;
			ptr = currentCase.indexOf(' ');
			
			N = Integer.parseInt(currentCase.substring(0,ptr));
			S = Integer.parseInt(currentCase.substring(ptr,currentCase.indexOf(' ',ptr+1)).trim());
			
			ptr = currentCase.indexOf(' ',ptr+1);
			
			p = Integer.parseInt(currentCase.substring(ptr,currentCase.indexOf(' ',ptr+1)).trim());

			
			for(int j=0;j<N;j++) {
				ptr = currentCase.indexOf(' ',ptr+1);
				if (j == N-1) {
					scoreSum = Integer.parseInt(currentCase.substring(ptr).trim());
				}
				else {
					scoreSum = Integer.parseInt(currentCase.substring(ptr,currentCase.indexOf(' ',ptr+1)).trim());
				}

				score1 = scoreSum / 3;
				score2 = (scoreSum - score1) / 2;
				score3 = scoreSum - score1 - score2;
				if (score1 >= p || score2 >= p || score3 >= p) {
					maxCount++;
					continue;
				}
				else {
					if ((S > 0) && (scoreSum > 0)) {
						if (scoreSum < (3*p-4)) {
							//Minimum total points required for to get at least 1 "best result"
							continue;
						}
						
						while ((Math.abs(score1 - score2) < 3) && (Math.abs(score1 - score3) < 3) && (Math.abs(score2 - score3) < 3)) {
							if (score1 >= score2 && score1 >= score3) {
								if (score2 >= score3) {
									if ((score1 + 1) - (score2 - 1) < 3) {
										score1++;
										score2--;
									}
								}
								else {
									if ((score1 + 1) - (score3 - 1) < 3) {
										score1++;
										score3--;
									}
								}
							}
							else if (score2 >= score1 && score2 >= score3) {
								if (score1 >= score3) {
									if ((score2 + 1) - (score1 - 1) < 3) {
										score2++;
										score1--;
									}
								}
								else {
									if ((score2 + 1) - (score3 - 1) < 3) {
										score2++;
										score3--;
									}
								}
							}
							else if (score3 >= score1 && score3 >= score2) {
								if (score1 >= score2) {
									if ((score3 + 1) - (score1 - 1) < 3) {
										score3++;
										score1--;
									}
								}
								else {
									if ((score3 + 1) - (score2 - 1) < 3) {
										score3++;
										score2--;
									}
								}
							}
							
							if (score1 >= p || score2 >= p || score3 >= p) {
								maxCount++;
								S--;
								break;
							}
						}
						
					}
				}
				
			}
			
			try {
				out.write("Case #"+(i+1)+": "+maxCount+'\n');
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
		try {
			out.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}	

	}

}
