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 dom.zar.jam.qualifications;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int inputLines = in.nextInt();
		for (int i = 0; i < inputLines;) {
			int googlersAmount = in.nextInt();
			int suprising = in.nextInt();
			int minPoints = in.nextInt();
			
			final int[] googlers = new int[googlersAmount];
			for (int k = 0; k < googlersAmount; ++k) {
				googlers[k] = in.nextInt();
			}
			
			System.out.println("Case #" + ++i + ": "
					+ result(suprising, minPoints, googlers));
		}
	}
	
	private static int result(int suprising, int minPoints,
			int[] googlers) {
		
		final List<Integer> filtered = new ArrayList<Integer>();
		for (int points : googlers) {
			boolean hasMin = (points / 3) >= minPoints;
			boolean oneLessThanMin 
				= ((points - minPoints) >> 1) == (minPoints - 1); 					
			
			if (!(hasMin || oneLessThanMin)) {
				filtered.add(points);
			}
		}
		
		int probable = 0;
		for (Integer points : filtered) {
			if (points - minPoints < 0) continue;
			int restPoints = (points - minPoints) >> 1; 
			if (Math.abs(restPoints - minPoints) <= 2) 
				probable++;
		}
		probable = Math.min(probable, suprising);
		
		return googlers.length - filtered.size() + probable;
	}
}
