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.IOException;
import java.io.InputStreamReader;

class Result {
	public boolean possible;
	public int newSurprises;
	
	public Result(int sur) {
		possible = false;
		newSurprises = sur;
	}
	
	public Result(boolean pos, int sur) {
		possible = pos;
		newSurprises = sur;
	}
}

class Input {
	int numCases;
	int numSurprises;
	int minScore;
	int [] sums;
	
	public Input(String line) {
		String [] arr = line.split(" ");
		numCases = Integer.parseInt(arr[0]);
		sums = new int[numCases];
		
		numSurprises = Integer.parseInt(arr[1]);
		minScore = Integer.parseInt(arr[2]);
		
		int j=3;
		for(int i=0;i<numCases;i++) {
			sums[i] = Integer.parseInt(arr[j]);
			j++;
		}
	}
	
	public Result CheckSatisfaction(int sum, int minScore, int surprises) {
		int quotient = sum/3;
		int rem = sum%3;
		
		if(quotient >= minScore) return new Result(true, surprises);
		
		// doesnt satisfy as is, try to use the remainder
		if(rem > 0) {
			if(quotient+1 >= minScore) return new Result(true, surprises);
			
			// even a 1 doesnt satisfy - we will have to use up surprises if we a bigger remainder
			if(rem == 2 && surprises > 0 && quotient+2 >= minScore)
				return new Result(true, surprises-1);
		} else if(rem == 0 && surprises > 0) {
			// no remainder, and doesnt satisfy, try to readjust
			// readjust for 1 if possible
			if(quotient >= 1 && quotient+1 >= minScore) return new Result(true, surprises-1);
		}
		
		//default
		return new Result(surprises);
	}
	
	public int Solve() {
		int count=0;
		int workingSurprises = numSurprises;
		for(int i=0;i<numCases;i++) {
			Result r = CheckSatisfaction(sums[i], minScore, workingSurprises);
			if(r.possible) {
				workingSurprises = r.newSurprises;
				count++;
			}
		}
		return count;
	}
}

public class Main {
	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		// Setup console
		BufferedReader c = new BufferedReader(new InputStreamReader(System.in));
		
		// Read number of test cases
		int numCases = Integer.parseInt(c.readLine());
		// Input
		Input [] testCases = new Input[numCases];
		for(int i=0;i<numCases;i++) {
			testCases[i] = new Input(c.readLine());
		}
		// Solve
		for(int i=0;i<numCases;i++) {
			int soln = testCases[i].Solve();
			System.out.println("Case #" + (i+1) + ": " + soln);
		}
	}
}

