import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

import java.util.*;
import java.io.*;

public class b {
  
  public static void main (String[] args){
    
    //settingup input and output
    Scanner in = null;
    PrintWriter out = null;
    try{
      in = new Scanner(new File("blarge.txt"));
      out = new PrintWriter(new FileOutputStream("blargeout.txt"), true);
    }catch(Exception e){
      System.out.println("file not found");
    }
    
    // number of cases
    int n = in.nextInt(); 
    in.nextLine();
    
    // run through each case
    for(int currentCase = 1; currentCase <= n; currentCase++){
      
      int result = 0;
      int N = in.nextInt(); // number of Googlers
      int S = in.nextInt(); // number of surprising triplets
      int p = in.nextInt(); // must be >= p to be considered
      int t[] = new int[N]; // total point for each Googler
      for(int i = 0; i < N; i++){
        t[i] = in.nextInt();
      }
      
      for(int i = 0; i < N; i++){
        if(t[i] >= (p*3 - 2)) result++; // automatically pass
        else if((S > 0) && ((((p*3 - 3) > 0) && (t[i] == (p*3 - 3)))  
                              || (((p*3 - 4) > 0) && (t[i] == (p*3 - 4))))){
          result++;
          S--; // consumes a quota of surprising triplet to pass
        }
      }
      
      //output answers for each case
      out.println("Case #" + currentCase + ": " + result);
    }
    
    // close input and output streams
    in.close();
    out.close();
  } 
}