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 org.resec;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;

public class Dancing_With_the_Googlers {

	public static void main(String[] args) {
		String filename = "B-small-attempt5";
		String sep = java.io.File.separator;
		try {
			FileInputStream input = new FileInputStream("c:" + sep + filename
					+ ".in");
			FileOutputStream output = new FileOutputStream("c:" + sep
					+ filename + ".out");
			int T = Integer.parseInt(readLine(input));
			for (int i = 1; i <= T; i++) {
				String G = readLine(input);
				String outLine = "Case #" + i + ": ";
				Go(input, output, G, outLine);
			}
			input.close();
			output.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	public static String readLine(FileInputStream FIS) {
		boolean EOL = true;
		String S = "";
		int in = 0;
		try {
			do {
				in = FIS.read();
				if (in == -1 || in == '\n')
					EOL = false;
				else
					S += (char) in;
			} while (EOL);
		} catch (IOException e) {
			e.printStackTrace();
		}
		return S;
	}

	public static int writeLine(FileOutputStream FOS, String S) {
		int i = 0;
		try {
			for (; i < S.length(); i++)
				FOS.write(S.charAt(i));
		} catch (IOException e) {
			e.printStackTrace();
		}
		return i;
	}

	public static void Go(FileInputStream FIS, FileOutputStream FOS, String G,
			String outLine) {
		String[] data = G.split(" ");
		int N = Integer.parseInt(data[0]);
		int S = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int cases = 0;
		for (int i = 0; i < N; i++) {
			int score = Integer.parseInt(data[i + 3]);
			int base = (int) (score / 3);

			switch (score % 3) {
			case 0: {
				if (base >= p)
					cases++;
				else {
					if (S > 0 && base > 0 && base + 1 >= p) {
						cases++;
						S--;
					}
				}
				break;
			}
			case 1: {
				if (base >= p || base + 1 >= p)
					cases++;
				else {
					if (S > 0 && base + 1 >= p) {
						cases++;
						S--;
					}
				}
				break;
			}
			case 2: {
				if (base + 1 >= p || base >= p)
					cases++;
				else {
					if (S > 0 && base + 2 >= p) {
						cases++;
						S--;
					}
				}
				break;
			}
			}
		}
		writeLine(FOS, outLine + cases + '\n');
	}
}
