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.File;
import java.util.Scanner;

public class Googlers {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("resource/B-small-attempt2.in"));
		int T = sc.nextInt(); 
		int i = 1;
		while (i<=T) {
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int t[] = new int[N];
			for(int j=0; j<N; j++){
				t[j] = sc.nextInt();
			}
			System.out.println("Case #"+i+": "+process(N, S, p, t));
			i++;
		}
	}
	private static int process(int n, int s, int p, int[] t) {
		int counter = 0;
		if(p==0) return t.length;
		for(int i=0; i<n; i++){
			if( t[i] <= 3*((p-2)>=0? (p-2): 0) + 1) {
				//Never happen
				continue;
			}
			else if(t[i] >= 3 * p - 2){
				//Not surprising
				counter++;
		    }
			else {
				//Surprising
				if(s>0){
					s--;
					counter++;
				}
			}
		}
		return counter;
	}
}
