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

import java.util.Scanner;

/**
 *
 * @author Kristanto
 */
public class Practice {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int test = s.nextInt();
        int[] result = new int[test];
        for (int x=0; x<test; x++){
            result[x] = 0;
            int googlers = s.nextInt();
            int surprising = s.nextInt();
            int limit = s.nextInt();
            for (int y=0; y<googlers; y++){
                int points = s.nextInt();
                if (points/3 >= limit){
                    result[x] = result[x]+1;
                } else if (points%3 >= 1){
                    if ((points/3)+1 == limit){
                        result[x] = result[x]+1;
                    }
                    else {
                        if (surprising != 0){ 
                            if ((points/3) + 2 == limit){
                                result[x] = result[x]+1;
                                surprising--;
                            }
                        }
                    }                 
                } else{
                    if (surprising != 0){
                        if ((points/3) + 1 == limit && points != 0){
                            result[x] = result[x] + 1;
                            surprising--;
                        }
                    }
                }
                
            }
        }
        
        for (int x=0; x<test;x++){
            System.out.println("Case #"+(x+1)+": "+result[x]);
        }
    }
}
