package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

/**
 * 
 */
package asem.googe.codejam.qround;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

/**
 * @author A.Alathwari
 * 
 * Problem B : 
 *
 */
public class ProblemB implements Runnable {
	
	asem.core.util.InputReader fin;
	java.io.PrintWriter fout;

	/**
	 * @param fin
	 * @param fout
	 */
	public ProblemB(asem.core.util.InputReader fin, PrintWriter fout) {
		this.fin = fin;
		this.fout = fout;
	}
	
	/**
	 * @param fin
	 * @param fout
	 * @throws IOException 
	 * @throws FileNotFoundException 
	 */
	public ProblemB(String fin, String fout) throws FileNotFoundException, IOException {
		this.fin  = new asem.core.util.InputReader(new FileReader(fin));
		this.fout = new PrintWriter(System.out);
	}
	
	/* (non-Javadoc)
	 * @see java.lang.Runnable#run()
	 */
	@Override
	public void run() {
		// TODO Auto-generated method stub
		try {
				
			for (int tNum = 1, inT = fin.readInt(); tNum <= inT; tNum++) {
				
				int N = fin.readInt();
				int S = fin.readInt();
				int P = fin.readInt();
				
				int [] googlers = new int [N];
				int y = 0;
				
				for (int i = 0; i < N; i++) {
					googlers[i] = fin.readInt();
					
					if (googlers[i] == 0) {
						if (P == 0)
							y++;
						continue;
					}

					if ((Math.ceil((double)googlers[i] / 3) >= P)) {
						y++;
						continue;
					}
					
					if (S > 0 && (Math.ceil((double)(googlers[i]-1) / 3) >= (P-1))) {
						y++;
						S--;
					}
				}

				System.out.println("Case #" + tNum + ": " + y);
			}
			
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}