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.palantir;

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

public class Googlers {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int numTests = s.nextInt();
        for (int i = 1; i <= numTests; ++i) {
            System.out.println("Case #" + i + ": " + solve(s));
        }
    }

    private static int solve(Scanner s) {
        int numGooglers = s.nextInt();
        int numSurprising = s.nextInt();
        int maxScore = s.nextInt();
        List<Integer> scores = new ArrayList<Integer>();
        for (int i = 0; i < numGooglers; ++i) scores.add(s.nextInt());
        int lowestGoodScore = (maxScore * 3) - 2;
        int lowestSurpriseScore = (maxScore * 3) - 4;
        if (maxScore == 0) {
            lowestGoodScore = 0;
            lowestSurpriseScore = 0;
        } else if (maxScore == 1) {
            lowestGoodScore = 1;
            lowestSurpriseScore = 1;
        }
        int goodScores = 0, surpriseScores = 0;
        for (int score : scores) {
            if (score >= lowestGoodScore) ++goodScores;
            else if (score >= lowestSurpriseScore) ++ surpriseScores;
        }
        if (numSurprising < surpriseScores) surpriseScores = numSurprising;
        return goodScores + surpriseScores;
    }
}
