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 com.google.codejam._2012;

import java.io.File;
import java.util.Scanner;

public class DancingWithGooglers
{

   int[][] maxScores;
   
   
   private void setup()
   {
      maxScores = new int[31][2];
      
      for(int i = 0; i <= 30; i++)
         maxScores[i][1] = -1;
      
      for(int score = 0; score <= 30; score++)
      {
         for(int s1 = 0; s1 <= 10; s1++)
            for(int s2 = 0; s2 <= 10; s2++)
               for(int s3 = 0; s3 <= 10; s3++)
               {
                  if (s1 + s2 + s3 != score)
                     continue;
                  
                  if (s1 > s2 || s1 > s3 || s2 > s3)
                     continue;
                  
                  if (Math.abs(s1 - s2) > 2 || Math.abs(s1 - s3) > 2 || Math.abs(s2 - s3) > 2)
                     continue;
                  
                  if (Math.abs(s1 - s2) == 2 || Math.abs(s1 - s3) == 2 || Math.abs(s2 - s3) == 2)
                     maxScores[score][1] = s3;
                  else
                     maxScores[score][0] = s3;
               }
      }
      
   }
   

   
   public void solveCases() throws Exception
   {
      setup();
      
      Scanner s = new Scanner(new File("./input/B-large.in"));

      
      int t = s.nextInt();
      s.nextLine();
      
      for(int i = 0; i < t; i++)
         solveProblem(s, i + 1);
   }

   

   
  
   private void solveProblem(Scanner s, int num)
   {
      System.out.print("Case #" + num + ": ");
      
      int n = s.nextInt();
      int sur = s.nextInt();
      int p = s.nextInt();

      int totSurprising = 0;
      int totalBest = 0;
      
      for(int i = 0; i < n; i++)
      {
         int score = s.nextInt();
         
         if (maxScores[score][0] >= p)
         {
            totalBest++;
            continue;
         }
         
         if (maxScores[score][1] != -1 && maxScores[score][1] >= p && totSurprising < sur)
         {
            totalBest++;
            totSurprising++;
         }
      }
      
      
      System.out.println(totalBest);
   }

   
   
   
   
   public static void main(String[] args)
   {
      DancingWithGooglers dwg = new DancingWithGooglers();
      
      try
      {
         dwg.solveCases();
      }
      catch (Exception e)
      {
         e.printStackTrace();
      }
      
   }
}
