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.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Dancing {

	public static void main(String[] args) throws IOException{
		Scanner sc = new Scanner(new File("dancing.in"));
		System.setOut(new PrintStream(new File("dancing.out")));
		ArrayList<Googler> changeAble = new ArrayList<Googler>(100);
		int t = sc.nextInt();
		for(int i=1; i<=t; i++){
			changeAble.clear();
			int n = sc.nextInt();//number of googlers
			int s = sc.nextInt();//number of surprises
			int p = sc.nextInt();//target
			int y = 0;//number that match
			for(int j=0; j<n; j++){
				Googler temp = new Googler(sc.nextInt(),p);
				if(temp.distAway < 1)
					y++;
				else if(temp.changeAble){
					changeAble.add(temp);
				}
			}
			Collections.sort(changeAble);
			for(int j=0; j<s && j<changeAble.size(); j++){
				Googler temp = changeAble.get(j);
				if(temp.maxScore+1 < p)
					break;
				y++;
			}
			System.out.println("Case #"+i+": "+y);
		}

	}

}
class Googler implements Comparable<Googler>{
	int distAway;
	boolean changeAble = false;
	int maxScore;
	int sScore;
	int score;
	int t;
	public Googler(int score, int target){
		t = target;
		this.score=score;
		int i = score/3;
		if(i*3==score){
			maxScore = i;
			changeAble = true;
		}
		else if(i*2+i+1 == score)
			maxScore = i+1;
		else if(i+(i+1)*2==score){
			maxScore = i+1;
			changeAble = true;
		}
		if(maxScore==0)
			changeAble = false;
		distAway = target-maxScore;
	}
	public int compareTo(Googler g){
		return distAway-g.distAway;
	}
	public String toString(){
		return score+"";
	}
}
