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;
	}

}

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

import java.util.Arrays;
import java.util.List;
import java.util.concurrent.Callable;




/**
 *
 * @author ken
 */
class DancingAlgorithm implements Callable<String> {
    private final int caseNumber;
    private final long surprises;
    private final long minScore;
    private final List<Long> totals;

    public DancingAlgorithm(int caseNumber, long surprises, long minScore, List<Long> totals) {
        this.caseNumber = caseNumber;
        this.surprises = surprises;
        this.minScore = minScore;
        this.totals = totals;

    }


    public String call() throws Exception {
        long meetsCount = 0;
        long meetsWithSurpriseCount = 0;
        
        for (Long total : totals) {
            double avgOther = (total - minScore)/ 2.0;
            long min = (long) Math.floor(avgOther);
            if (min < 0) continue;                    
            if (min + 1 >= minScore) {
                meetsCount++;
            } else if (min + 2 >= minScore) {
                meetsWithSurpriseCount++;
            }            
        }
        
        long retval = meetsCount + Math.min(meetsWithSurpriseCount, surprises);
        return String.format("Case #%d: %d", caseNumber, retval);
    }

    @Override
    public String toString() {
        return totals.toString();
    }
    
    
}
