/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.util.*;


public class GCJ2012QualB{
  public  static void main(String args[]){
    
    Scanner s = new Scanner(System.in);
    int t = s.nextInt();
    
    for(int mon=1;mon<=t; mon++){
      
      int nplayer=s.nextInt();
      int nsuprise=s.nextInt();
      int nscore=s.nextInt();
      int ans=0;
      int scores[];
      scores = new int [nplayer];
      for (int i=0; i<nplayer; i++){
        scores[i]=s.nextInt();
      } 
      // java.util.Arrays.sort(scores);
      int limsup=nscore-2;
      if(limsup<0){
        limsup=0;
      }
      int limsupall=nscore+limsup+limsup;
      int limnormal=nscore-1;
      if(limnormal<0){
        limnormal=0;
      }
      int limnormalall=nscore+limnormal+limnormal;
      for (int i=0; i<nplayer; i++){
        int checkscore=scores[i];
        if(checkscore>=limnormalall){
          ans+=1;
        }
        else if(checkscore>=limsupall){
          if (nsuprise>0){
            ans+=1;
            nsuprise-=1;
          }
        }
      }
      
      
      System.out.println("Case #"+ mon+": "+ans);
      
    }
    
  }
}
