/**
 * 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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;


public class Main_Dance {
	public static void main(String[] args)throws Exception {
		File _=new File("dance.in");
		BufferedReader br=_.exists()? new BufferedReader(new FileReader(_)):new BufferedReader(new InputStreamReader(System.in));
		int t=Integer.parseInt(br.readLine().trim());
		int n,s,p;
		ArrayList<Integer> scores;
		StringTokenizer st;
		int k,surprising,total;
		
		for (int i = 1; i <= t; i++) {
			scores=new ArrayList<Integer>();
			st=new StringTokenizer(br.readLine());
			n=Integer.parseInt(st.nextToken());
			s=Integer.parseInt(st.nextToken());
			p=Integer.parseInt(st.nextToken());
			k=p+2*Math.max(0, p-2);
			
			
			for (int j = 0; j < n; j++) {
				scores.add(Integer.parseInt(st.nextToken()));
			}
			total=0;
			surprising=0;
			Collections.sort(scores);
			for (int j = 0; j < scores.size(); j++) {
				if(scores.get(j)>=k)
					total++;
				if((p!=1&&p!=0)&&(scores.get(j)==p+2*(p-2)||scores.get(j)==p+2*(p-2)+1))
					surprising++;
			}
			
			if(surprising>s)
				total-=surprising-s;
			
			
			System.out.println("Case #"+i+": "+total);
		}
		
	}
}
