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

public class QualificationRoundB {
    public static void main(String[] args) throws IOException {
        String inFile = args[0];
        String outFile = inFile.replaceAll("\\.in$", ".out");

        Scanner scanner = new Scanner(new FileInputStream(inFile));
        int cases = scanner.nextInt();

        FileWriter fileWriter = new FileWriter(outFile);
        BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);
        for(int c = 1; c <= cases; c++){
            bufferedWriter.write(String.format("Case #%d: ", c));
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int p = scanner.nextInt();
            int t[] = new int[N];
            for(int n = 0; n < N; n++)
                t[n] = scanner.nextInt();

            int count = 0;
            int midTop = 3*p - 3;
            int midBot = 3*p - 4;
            for(int n = 0; n < N; n++){
                switch(p){
                    case 0:
                    case 1:
                        if(t[n] >= p)
                            count++;
                        break;
                    default:
                        if(t[n] > midTop){
                            count++;
                        }
                        else if(t[n] >= midBot && S > 0){
                            S--;
                            count++;
                        }
                }
            }
            System.out.println(String.format("%d", count));
            bufferedWriter.write(String.format("%d\n", count));
        }
        bufferedWriter.close();
        fileWriter.close();
    }
}
