/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
public class DancingWiththeGooglers {
 
        public static void main(String[] args) throws Exception {
                PrintWriter out = new PrintWriter("output.out");
                Scanner in = new Scanner(new File("B-small-attempt19.in"));
        int testCases = in.nextInt();
        for (int i = 1; i <= testCases; i++){
                int N = in.nextInt(),counter=0;
                int S = in.nextInt();
                int P = in.nextInt();
                for(int j = 0 ; j < N ;j++){
                        int googler= in.nextInt();
                        if(googler%3 == 0 && googler!=0){
                                if(googler/3 >= P){
                                        counter++;
                                }
                                else if(googler/3 + 1 >= P && S!=0){
                                        counter++;
                                        S--;
                                }
                        }
                        else if (googler==0 && P==0){
                        	counter++;
                        }
                        else if(googler%3==1){
                                if(googler/3 + 1 >= P){
                                        counter++;
                                }
                        }
                        else if(googler%3==2){
                                if(googler/3 + 1 >= P){
                                        counter++;
                                }
                                else if(googler/3 + 2 >= P && S!=0){
                                        counter++;
                                        S--;
                                }
                        }
                }
                out.printf("Case #%d: %d",i,counter);
                out.printf("\n");
        }
        out.close();
        in.close();
 
        }
 
}