/**
 * 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.*;
import java.util.StringTokenizer;

public class Solution {
	public static void main(String args[]){
		try{
		FileInputStream fin=new FileInputStream("C:\\Program lang\\Google Code Jam\\input00.txt");
		DataInputStream datain=new DataInputStream(fin);
		BufferedReader br=new BufferedReader(new InputStreamReader(datain));
		int T=Integer.parseInt(br.readLine());
		for(int j=0;j<T;j++){
		StringTokenizer st=new StringTokenizer(br.readLine());
		int N=Integer.parseInt(st.nextToken());// googlers
		int S=Integer.parseInt(st.nextToken());// surprising triplets
		int p=Integer.parseInt(st.nextToken());// least max of triplet
		int out=0;
		for(int i=0;i<N;i++){
			int num=Integer.parseInt(st.nextToken());
			if(num%3==0){
				if(num/3>=p){
					out++;
				}
				else if((num+3)/3==p && S>0 && num>=3)	{
					S--;
					out++;
				}
				
			}
			else if(num%3==1){
				if((num+2)/3>=p)	out++;
			}
			else{
				if((num+1)/3>=p && num>=2)	out++;
				else if((num+4)/3>=p && S>0 && num>=2) {
					out++;
					S--;
				}
			}
		}
		System.out.println("Case #"+(j+1)+": "+out);
		
		}
		
		}catch(Exception e){
			System.out.println(e);
		}
	}
	
}