/**
 * 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.Scanner;


public class SolutionDancingWithGooglers {

	static int[] notes;
	static int surprising;
	
	
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		
		int cases = sc.nextInt();
		
		for(int i = 0; i < cases; i++){
			
			int googlers = sc.nextInt();
			
			surprising = sc.nextInt();
			
			int p = sc.nextInt();
			
			int counter = 0;
			
			for(int j = 0; j < googlers; j++){
				int triplet = sc.nextInt();
				int[] scores = new int[3];
				
				scores[0] = triplet/3;
				triplet = triplet - triplet/3;
				scores[1] = triplet/2;
				triplet = triplet - triplet/2;
				scores[2] = triplet;
				
				counter = counter + verify(scores, surprising, p);
			}
			
			System.out.println("Case #" + (i+1) + ": " + counter);
			
		}
			
			
			
	}
		
	public static int verify(int[] v, int count, int comp){
		//System.out.println("count: "+count);
		if(good(v, comp)){
			 return 1;
		}else if(count != 0  && (v[0] > 0 && v[2] < 10)){
			if(v[0] != v[1] || v[2] != v[1] + 1){
			v = mod(v);
			if(possible(v) && good(v, comp)){ 
				surprising = count - 1;
				return 1;
			}else return 0;
			}else return 0;
		}else return 0;
		
	}
	
	public static boolean good(int[] v, int comp){
		
		for(int i = 0; i < v.length; i++){
			if(v[i] >= comp){ 
				return true;
			}
		}
		return false;
		
	}
	
	public static boolean possible(int[] v){
		
		if(Math.abs(v[0] - v[1]) > 2) return false;
		else if(Math.abs(v[1] - v[2]) > 2) return false;
		else if(Math.abs(v[2] - v[0]) > 2) return false;
		else return true;
		
	}
	
	public static int[] mod(int[] v){
		
		
		if(v[0] == v[1] && v[1] == v[2]){
			v[0] = v[0] - 1;
			v[2] = v[2] + 1;
			
			return v;
		}else{
			v[1] = v[1] - 1;
			v[2] = v[2] + 1;
			return v;
		}
		
	}
	
	

}
