import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

package com.google.codejam;

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

public class GooglerDanceSolver {

	public static int getMaximumPassCount(int passScore, int surpriseCount, List<Integer> scores) {
		int passCount = 0;

		int lowerBound = (passScore > 1) ? 3 * passScore - 4 : passScore;
		
		for (int score : scores) {
			if (score < lowerBound) {
				continue;
			} else if (score > 3 * passScore - 3) {
				passCount++;
			} else if (surpriseCount > 0) {
				passCount++;
				surpriseCount--;
			}
		}
		
		return passCount;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int totalCount = Integer.parseInt(scanner.nextLine());
		
		for (int i = 0; i < totalCount; i++) {
			String[] inputs = scanner.nextLine().split(" ");
			int n = Integer.parseInt(inputs[0]);
			int s = Integer.parseInt(inputs[1]);
			int p = Integer.parseInt(inputs[2]);
			List<Integer> scores = new ArrayList<Integer>(n);
			for (int j = 0; j < n; j++) {
				scores.add(Integer.parseInt(inputs[j+3]));
			}
			int answer = GooglerDanceSolver.getMaximumPassCount(p, s, scores);
			System.out.printf("Case #%d: %d%n", i+1, answer);
			//System.err.printf("[Debug Info] p=%d, s=%d, scores=%s%n", p, s, scores.toString());
		}
	}

}
