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 fixjava;

import java.util.ArrayList;

/**
 * String splitter, this fixes the problem that String.split() has of losing the last token if it's empty. It also uses
 * CharSequences rather than allocating new String objects.
 */
public class Split {

	/**
	 * String splitter, this fixes the problem that String.split() has of losing the last token if it's empty. It also uses
	 * CharSequences rather than allocating new String objects.
	 */
	public static ArrayList<CharSequence> splitAsList(String str, String sep) {
		int strLen = str.length();
		int sepLen = sep.length();
		assert sepLen > 0;

		ArrayList<CharSequence> parts = new ArrayList<CharSequence>();
		for (int curr = 0; curr <= strLen;) {
			// Look for next token
			int next = str.indexOf(sep, curr);
			// Read to end if none
			if (next < 0)
				next = strLen;
			// Add next token
			parts.add(str.subSequence(curr, next));
			// Move to end of separator, or past end of string if we're at the end
			// (by stopping when curr <= strLen rather than when curr < strLen,
			// we avoid the problem inherent in the Java standard libraries of
			// dropping the last field if it's empty; fortunately
			// str.indexOf(sep, curr) still works when curr == str.length()
			// without throwing an index out of range exception).
			curr = next + sepLen;
		}
		return parts;
	}

	public static CharSequence[] splitAsArray(String str, String sep) {
		ArrayList<CharSequence> list = splitAsList(str, sep);
		CharSequence[] arr = new CharSequence[list.size()];
		list.toArray(arr);
		return arr;
	}

	public static ArrayList<String> splitAsListOfString(String str, String sep) {
		ArrayList<CharSequence> list = splitAsList(str, sep);
		ArrayList<String> listOfString = new ArrayList<String>(list.size());
		for (CharSequence cs : list)
			listOfString.add(cs.toString());
		return listOfString;
	}

	/** For compatibility only, slower because it creates new String objects for each CharSequence */
	public static String[] split(String str, String sep) {
		ArrayList<CharSequence> list = splitAsList(str, sep);
		String[] arr = new String[list.size()];
		for (int i = 0; i < list.size(); i++)
			arr[i] = list.get(i).toString();
		return arr;
	}

	//	public static void main(String[] args) {
	//		System.out.println(splitAsList("", "\t"));
	//		System.out.println(splitAsList("\t", "\t"));
	//		System.out.println(splitAsList("a\t", "\t"));
	//		System.out.println(splitAsList("\ta", "\t"));
	//		System.out.println(splitAsList("\ta\t", "\t"));
	//		System.out.println(splitAsList("a\tb", "\t"));
	//		System.out.println(splitAsList("a\tb\t", "\t"));
	//		System.out.println(splitAsList("\ta\tb", "\t"));
	//		System.out.println(splitAsList("", "SEP"));
	//		System.out.println(splitAsList("SEP", "SEP"));
	//		System.out.println(splitAsList("aSEP", "SEP"));
	//		System.out.println(splitAsList("SEPaSEPb", "SEP"));
	//		System.out.println(splitAsList("aSEPbSEP", "SEP"));
	//	}

}
