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

}

import util.CombinationGenerator;

import java.util.ArrayList;
import java.util.List;
import java.util.Map;

public class SetUtil {
    public static long getOne(int n) {
        return 1<<n;
    }

    public static List<Integer> getList(long set, int n) {
        ArrayList<Integer> integers = new ArrayList<>();
        for (int i=0;i<n; i++) {
            if ((set & getOne(i))!=0) {
                integers.add(i);
            }
        }
        return integers;
    }
    public static <T>long getForList(Map<T,Integer> positions, List<T> objs) {
        long res = 0L;
        for (T obj : objs) {
            int pos = positions.get(obj);
            res |= getOne(pos);
        }
        return res;
    }

    public static void cycleSubsets(int num, SubsetCallBack callBack) {
        callBack.run(0, 0);
        for (int i =  1; i<=num; i++) {
            CombinationGenerator generator = new CombinationGenerator(num,i);

            while (generator.hasMore()) {
                long n = 0;
                int[] next = generator.getNext();
                for (int i1 : next) {
                    n |= getOne(i1);
                }
                callBack.run(n,i);
            }
        }

    }

    public static interface SubsetCallBack {
        void run(long subset, int i);
    }
}
