import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

package com.nolmecolindor.gcj2012.round0;

import java.io.FileInputStream;
import java.io.IOException;
import java.util.Scanner;

public class Problem_B_0 {
	
	private int solve(final Scanner input) {
		final int N = input.nextInt();
		final int S = input.nextInt();
		final int P = input.nextInt();
		final int[] points = new int[31];
		for (int i = 0; i < N; i++) points[input.nextInt()]++;
//		System.out.println("Point distribution: ");
//		for (int i = 0; i <= 30; i++) System.out.println(points[i] + " dancers got " + i + " points.");

		int remainingSurprises = S;
		
		int result = 0;
		for (int i = 30; i >= 0; i--) {
			if (points[i] == 0) continue;
			final int min;
			final int max;
			switch (i % 3) {
			case 0:
				min = i / 3;
				max = min;
				if (max >= P) { // We reach the limit by default
					result += points[i];
				} else if ((max + 1 == P) && (min > 0) && (max < 10)) { // We can reach the limit with surprises
					final int useSurprises = Math.min(points[i], remainingSurprises);
					remainingSurprises -= useSurprises;
					result += useSurprises;
				} else { // We can not reach the limit anyway
					// We are not interested
				}
				break;
			case 1:
				max = (i - 1) / 3 + 1;
				if (max >= P) result += points[i];
				break;
			case 2:
				min = (i - 2) / 3;
				max = min + 1;
				if (max >= P) { // We reach the limit by default
					result += points[i];
				} else if ((max + 1 == P) && (max < 10)) { // We can reach the limit with surprises
					final int useSurprises = Math.min(points[i], remainingSurprises);
					remainingSurprises -= useSurprises;
					result += useSurprises;
				} else { // We can not reach the limit anyway
					// We are not interested
				}
				break;
			}
			
		}
		return result;
	}
	
	
	private void solveAll(final Scanner input) throws NumberFormatException, IOException {
		final int cases = input.nextInt();
		input.nextLine();
		for (int caseNum = 1; caseNum <= cases; caseNum++) {
			System.out.println("Case #" + caseNum + ": " + solve(input));
		}
	}
	
	public static void main(final String[] args) {
		try {
			final Scanner input = new Scanner(((args.length == 2) && args[0].equals("--input")) ? new FileInputStream(args[1]) : System.in);
			new Problem_B_0().solveAll(input);
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
