/**
 * 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.util.*;
import java.io.*;
class DancingWithTheGooglers{
	Scanner input;
	PrintWriter output;
	StringBuilder answer = new StringBuilder();

	public static void main(String[] args){
		DancingWithTheGooglers app = new DancingWithTheGooglers();
		app.openInput(args[0]+".in");
		app.setOutput(args[0]+".out");
		app.solve();
		app.saveAndCloseOutput();
	}

	public void openInput(String filename){
		try{
			input = new Scanner(new File(filename));
		} catch (Exception e){
			e.printStackTrace();
		}
	}

	public void setOutput(String filename){
		try{
			output = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
		} catch (Exception e){
			e.printStackTrace();
		}
	}

	public void solve(){
		int nCase = input.nextInt();
		input.nextLine();
		int n,s,p;
		int count = 0;
		for(int i=1;i<=nCase;i++){
			n = input.nextInt();
			s = input.nextInt();
			p = input.nextInt();

			count = 0;
			for(int j=0;j<n;j++){
				int score = input.nextInt();
				switch(score%3){
					case 0:
						if(score/3>=p){count++;}
						else if(s>0 && score != 0 && score/3+1 == p){count++;s--;}
						break;
					case 1:
						if(score/3 + 1 >= p){count++;}
						break;
					case 2:
						if(score/3 + 1 >= p){count++;}
						else if(s>0 && score/3 + 2 == p){count++;s--;}
						break;
				}
			}
			output.println("Case #"+i+": "+count);
		}
	}

	public void saveAndCloseOutput(){
		output.close();
	}
}
