/**
 * 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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Dance {
	public static void main(String[] args) throws FileNotFoundException{
		
		Scanner scan = new Scanner (new File("C:\\Users\\kffong\\Desktop\\JAVA_workspace\\DanceGoogler\\input.txt"));
	//	Scanner scan = new Scanner(new File("C:\\Users\\kffong\\Desktop\\JAVA_workspace\\DanceGoogler\\input.txt"));
	//	System.out.print(scan.nextLine());
		int numberOfCase = scan.nextInt();
		scan.nextLine();
		
		for(int k=0 ; k<numberOfCase; k++){
			int N = scan.nextInt();
			int surprise = scan.nextInt();
			int p = scan.nextInt();
			int total[] = new int[N];
			int result = 0;
			int possibleIncrease = 0;
			
			for ( int i = 0 ; i < N ; i++){
				total[i]=scan.nextInt();
			}

			
			
			
			for(int i = 0 ; i<N ; i++){
				int best;
				if (total[i]%3==0){
					best=total[i]/3;
				}
				else{
					best=total[i]/3 + 1;
				}
				
				
				if(best>=p){
					result++;
				}
				else if(best==p-1 && total[i]%3!=1 &&total[i]!=0){
					possibleIncrease++;
				}
			
			}
		//	System.out.println("possibleIncrease="+possibleIncrease+" ;result="+result);
			
			
			if (possibleIncrease<=surprise){
				result = result+possibleIncrease;
			}
			else{
				result = result+surprise;
			}
			System.out.println("Case #"+(k+1)+": "+result);
			
			
			//System.out.println("====================");
			
			if(scan.hasNextLine()){
				scan.nextLine();
			}
			
		}

	}
}
