import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class DancingWithGooglers_1B_QualGCJ12 {
	public static void main(String[] args) {
		try{
			BufferedReader br = new BufferedReader(new FileReader("E:\\Code\\Algorithmz\\src\\myFiles\\B-small-attempt0.in"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("E:\\Code\\Algorithmz\\src\\myFiles\\B-small-attempt0.out"));
			int T=Integer.parseInt(br.readLine());
			for(int currTest=1;currTest<=T;currTest++){
				String currentTestCase[] = br.readLine().split(" ");
				int N=Integer.parseInt(currentTestCase[0]);
				int S=Integer.parseInt(currentTestCase[1]);
				int p=Integer.parseInt(currentTestCase[2]);
				int possibleCount=0;
				for(int currentDancer=3,totalDancers=currentTestCase.length;currentDancer<totalDancers;currentDancer++){
					int currentTotal=Integer.parseInt(currentTestCase[currentDancer]);
					if(currentTotal<p)
						continue;
					if(currentTotal>=(3*p - 2))
						possibleCount++;
					else if (currentTotal>=(3*p -4) && --S>=0)
						possibleCount++;
				}
				bw.write("Case #"+(currTest)+": " +  possibleCount+"\n");
			}
			bw.close();
		}catch(Exception e){
			e.printStackTrace();
		}
		System.err.println("Done");
	}

}
