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 qualification.b;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Core {
  
  public static void main(String[] args) {
    int t, n, s, p;
    
    try {
      Scanner scan = new Scanner(new File(args[0]));
      
      t = scan.nextInt();
      for (int i = 1; i <= t; i++) {
        n = scan.nextInt();
        s = scan.nextInt();
        p = scan.nextInt();
        
        System.out.println(solve(i, n, s, p, scan));
      }
    } catch (FileNotFoundException e) {
      e.printStackTrace();
    }
  }
  
  public static String solve(int caseNumber, int n, int s, int p, Scanner scan) {
    int rangeMin, rangeMax;
    rangeMin = p + (2 * Math.max(0, p - 2)); // inc
    rangeMax = p + (2 * Math.max(0, p - 1)); // exc
    
    List<Integer> aboveP = new ArrayList<Integer>();
    int score, used;
    used = 0;
    for (int i = 0; i < n; i++) {
      score = scan.nextInt();
      
      if (score < rangeMin)
        continue;
      else if (score >= rangeMax)
        aboveP.add(score);
      else if (((score - rangeMin) <= 1) && (used < s)) {
        used++;
        aboveP.add(score);
      }
    }
    
    return "Case #" + caseNumber + ": " + aboveP.size();
  }
}