import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            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();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


package ru.bobukh.problems;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Map;
import java.util.Scanner;

/**
 *
 * @author anton.bobukh
 */
public class ProblemB_DancingWithTheGooglers {
    
    public static void main(String[] args) throws IOException {
        Map<Character, Character> mapping = ProblemA_SpeakingInTongues.GetMapping();
        
        try (Scanner input = new Scanner(new BufferedReader(new FileReader("C:\\Users\\maggot\\Desktop\\B-large.in")))) {
            int T = input.nextInt();
            input.nextLine();
            
            try(PrintWriter output = new PrintWriter("C:\\Users\\maggot\\Desktop\\output.txt")) {
                for(int k = 0; k < T; ++k) {
                    output.println(String.format("Case #%d: %d", k + 1, processLine(input.nextLine())));
                }
            }
        }
    }
    
    public static int processLine(final String line) {
        int counter = 0;
        try (Scanner lineReader = new Scanner(line)) {
            lineReader.useDelimiter(" ");
            int N = lineReader.nextInt();
            int S = lineReader.nextInt();
            int P = lineReader.nextInt();

            for (int i = 0; i < N; ++i) {
                int value = lineReader.nextInt();

                if(value >= P && value - P >= 2 * (P - 1)) {
                    ++counter;
                } else if(value >= P && value - P >= 2 * (P - 2) && S > 0) {
                    ++counter;
                    --S;
                }
            }
        }
        
        return counter;
    }
    
}
