import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package google2012;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author g
 */
public class Google2012 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            BufferedReader reader = new BufferedReader(new FileReader(args[0]));
            String line;
            int numCases = Integer.parseInt(reader.readLine());
            for (int i=0; i<numCases; i++) {
                line = reader.readLine();
                String[] tokens = line.split(" ");
                int dancers = Integer.parseInt(tokens[0]);
                int special = Integer.parseInt(tokens[1]);
                int maxScore = Integer.parseInt(tokens[2]);
                int minSumWithoutSpecial = maxScore+Math.max((maxScore-1),0)+Math.max(maxScore-1,0);
                int minSumWithSpecials = maxScore+Math.max(maxScore-2,0)+Math.max(maxScore-2,0);
                int counter=0;
                for (int j=0; j<dancers; j++) {
                    int sum = Integer.parseInt(tokens[3+j]);
                    if (sum >= minSumWithoutSpecial) {
                        counter++;
                        continue;
                    }
                    if (sum >= minSumWithSpecials && special > 0) {
                        counter++;
                        special--;
                        continue;                       
                    }
                }
                System.out.println("Case #" + (i+1) + ": " + counter);
            }
        } catch (IOException ex) {
            Logger.getLogger(Google2012.class.getName()).log(Level.SEVERE, null, ex);
        }
        
    }
}
