import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class r2a
{

	int surprises = 0;
	int p = 0;
	int elems[] = new int[100];
    int output = 0;

    /**
     * @param args
     */
    public static void main(String[] args)
    {
        r2a mk = new r2a();
        try {
            FileInputStream fstream = new FileInputStream("d:/cjinput.txt");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            String str;
            int i = 0;
            while ((str = br.readLine()) != null) {
            	int numOfElems = 0;
            	mk.output = 0;
                i++;
                if (i == 1)
                    continue;
                StringTokenizer strTok = new StringTokenizer(str, " ");
                while (strTok.hasMoreTokens()) {
                	numOfElems =  Integer.parseInt(((String) strTok.nextToken()));
                    mk.surprises = Integer.parseInt(((String) strTok.nextToken()));
                    mk.p = Integer.parseInt(((String) strTok.nextToken()));
                    for (int x = 0; x < numOfElems; x++) {
                        mk.elems[x] = Integer.parseInt(((String) strTok.nextToken()));
                    }
                }

                mk.evaluate(i,numOfElems);

            }
            in.close();
        }
        catch (Exception e) {
            System.err.println(e);
        }

    }

    private void evaluate(int rowNum, int numOfElems)
    {
    	
    	for (int i = 0; i< numOfElems; i++) {
    		if (isValidTotal(elems[i])) 
    			output++;
    		
    	}

        String outputStr = "Case #" + (rowNum -1) + ": " + output;
        System.out.println(outputStr);
    }

	private boolean isValidTotal(int num) {
		
		if (p==0)
			return true;
		if (num != 0) {
			int maxVal = 3*p;
			if (num >= maxVal-2)
				return true;
			if (num >= maxVal-4 && surprises > 0) {
				surprises--;
				return true;
			}
		}
		return false;
	}
}
