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

package lk.iit.wall.framework.network;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * User: Amila
 * Date: 4/13/12
 * Time: 10:48 PM
 * To change this template use File | Settings | File Templates.
 */
public class CodeJamOne {

    public static void main(String[] args) {
        File file = new File("D:\\small.txt");
        try {
            //
            // Create a new Scanner object which will read the data
            // from the file passed in. To check if there are more
            // line to read from it we check by calling the
            // scanner.hasNextLine() method. We then read line one
            // by one till all line is read.
            //
            Scanner scanner = new Scanner(file);
            int cases = scanner.nextInt();
            for (int i = 0; i < cases; i++) {
                int googlers = scanner.nextInt();
                int supprise = scanner.nextInt();
                int max = scanner.nextInt();
                int numGoog = 0;
                int[] nums = new int[googlers];
                for (int j = 0; j < googlers; j++) {
                    int score = scanner.nextInt();
                    nums[j] = score;
                }
                Arrays.sort(nums);
                for (int j = googlers - 1; j >= 0; j--) {
                    int score = nums[j];
                    double d = score / 3f;
                    int div = (int) Math.ceil(d);
                    int mod = score % 3;
                    if (div >= max) {
                        numGoog++;
                        continue;
                    }
                    /*if (mod == 2) {
                        if (div + 2 >= max && supprise != 0 && score > 1 && score < 29) {
                            numGoog++;
                            supprise--;
                            continue;
                        }
                    } else */if(mod==0 || mod == 2){
                        if (div + 1 >= max && supprise != 0 && score > 1 && score < 29) {
                            numGoog++;
                            supprise--;
                            continue;
                        }
                    }
                }
                System.out.println("Case #" + (i + 1) + ": " + numGoog);

            }
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }
}
