import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package competition;

/**
 *
 * @author Sriram
 */

import java.util.Scanner;
import java.io.FileInputStream;
import java.io.PrintStream;

public class DancingWithGooglers_GCJ_2012 {
    
    public static void main(String args[]) throws Exception
    {
        Scanner in = new Scanner(new FileInputStream("f:\\input.in"));
        PrintStream out = new PrintStream("f:\\output.out");
        int T = in.nextInt();
        for(int i=0;i<T;i++)
        {
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int result = 0;
            int p1,p2,p3;
            int[] scores = new int[N];
            if(p>1)
            {
                p1 = (3*p)-4;
                p2 = p1+1;
            }
            else
            {
                p1 = p2 = p;
            }
            for(int j=0;j<N;j++)
            {
                scores[j] = in.nextInt();
            }
            for(int j=0;(j<N)&&(S>0);j++)
            {
                if(scores[j]==p1)
                {
                    result++;
                    S--;
                }
            }
            for(int j=0;(j<N)&&(S>0);j++)
            {
                if(scores[j]==p2)
                {
                    result++;
                    S--;
                }
            }
            for(int j=0;j<N;j++)
            {
                if(scores[j]>p2)
                {
                    result++;
                }
            }
            if(p == 0)
                result = scores.length;
            out.printf("Case #%d: %d\n",(i+1),result);
            
        }
    }
}
