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

	   }
}

/**
 * 
 */
package kr.javanese.gcj2012.qr.b;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;

/**
 * @author javanese
 *
 */
public class DancingWithTheGooglers {

	private int findMax(int s, int p, int[] t) {
		int n = t.length;
		int[] tremaining = new int[t.length];
		int bmin[] = new int[t.length]; // min of possible best scores
		int bmax[] = new int[t.length]; // max of possible best scores
		boolean[] shouldBeSuprising = new boolean[n];
		
		int count = 0;
		int shouldBeSuprisingCount = 0;
		for (int i=0; i<n; i++) {
			tremaining[i] = t[i] % 3;
			switch(tremaining[i])
			{
			case 0:
				if (t[i]==0) {
					bmin[i] = 0;
					bmax[i] = 0;
				} else {
					bmin[i] = t[i]/3;
					bmax[i] = t[i]/3+1;
				}
				if (bmin[i]>=p) {
					count++;
				} else if (bmax[i]==p) {
					shouldBeSuprising[i] = true;
					shouldBeSuprisingCount++;
				}
				break;
			case 1:
				bmin[i] = t[i]/3+1;
				bmax[i] = t[i]/3+1;
				if (bmin[i]>=p) {
					count++;
				}
				break;
			case 2:
				bmin[i] = t[i]/3+1;
				bmax[i] = t[i]/3+2;
				if (bmin[i]>=p) {
					count++;
				} else if (bmax[i]==p) {
					shouldBeSuprising[i] = true;
					shouldBeSuprisingCount++;
				}
				break;
			}
			System.err.println(">> "+i+": "+bmin[i]+", "+bmax[i]+", "+count+"["+shouldBeSuprisingCount+"]");
		}
		
		if (shouldBeSuprisingCount>=s) {
			count += s;
		} else {
			count += shouldBeSuprisingCount;
		}
		return count;
	}

	public static void main(String[] args) {
		try {
			DancingWithTheGooglers instance = new DancingWithTheGooglers();

			BufferedReader reader;
			if (args.length > 0) {
				reader = new BufferedReader(new FileReader(args[0]));
			} else {
				reader = new BufferedReader(new InputStreamReader(System.in));
			}
			String line = null;
			line = reader.readLine();
			int caseCount = Integer.parseInt(line);

			long startTime = System.currentTimeMillis();

			for (int i = 0; i < caseCount; i++) {
				line = reader.readLine();
				String[] tokens = line.split(" ");
				int n = Integer.parseInt(tokens[0]);
				int s = Integer.parseInt(tokens[1]);
				int p = Integer.parseInt(tokens[2]);
				int t[] = new int[n];
				for (int j=0; j<n; j++) {
					t[j] = Integer.parseInt(tokens[j+3]);
				}
				
				System.out.print("Case #");
				System.out.print(i + 1);
				System.out.print(": ");
				System.out.println(instance.findMax(s, p, t));
			}

			System.err.println("Elasped Time : "
					+ (System.currentTimeMillis() - startTime));
			reader.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
