/**
 * 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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class DancingWithTheGooglers {

	private int calc(){
		return 0;
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int total = in.nextInt();
		
		int totGooglers = 0;
		int totStriplets = 0;
		int totPoints = 0;
		int pointsGooglers = 0;
		
		List<int []> scores = new ArrayList<int []>();
		
		for (int i = 1; i <= total; i++) {
			int result = 0;
			
			totGooglers = in.nextInt();
			totStriplets = in.nextInt();
			totPoints = in.nextInt();
			
			for (int j = 0; j < totGooglers; j++) {
				int [] tot = new int[2];
				pointsGooglers = in.nextInt();
				int auxPointsGooglers = pointsGooglers;
				int aux = 0;
				
				for (int k = 0; k < 3; k++) {
					if(auxPointsGooglers%3==0){
						auxPointsGooglers = auxPointsGooglers/3;
						break;
					}else if(auxPointsGooglers>0){
						aux++;
						auxPointsGooglers--;
					}
				}
				
				tot = new int[]{auxPointsGooglers, auxPointsGooglers, auxPointsGooglers};
				
				if(aux==2){
					tot[0]++;
					tot[1]++;
				}else if(aux==1){
					tot[0]++;
				}
				
				scores.add(tot);
			}
			
			int auxTotStriplets = totStriplets;
			int auxResult = 0;
			for (int[] js : scores) {
				
				for (int k : js) {
					if(k>=totPoints){
						auxResult++;
					}
				}
				
				if(auxResult==0){
					if(auxTotStriplets>0){
						if(((js[1]-1)>=0 || (js[2]-1)>=0)){
							if((js[0]+1)>=totPoints){
								if(js[2]>js[1] || js[2]==js[0]){
									js[2]--;
									auxTotStriplets--;
									js[0]++;
								}else if(js[1]>js[2]){
									js[1]--;
									auxTotStriplets--;
									js[0]++;
								}
							}
						}
					}
				}
				
				auxResult = 0;
				
			}
			
			for (int[] js : scores) {
				for (int k : js) {
					if(k>=totPoints){
						result++;
						break;
					}
				}
			}
			
			scores.clear();
				
			System.out.format("Case #%d: %s\n", i, result);
		}
	}
}
