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;
  }
}

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

import java.io.*;
import java.util.Arrays;
import java.util.HashMap;

/**
 *
 * @author Ostap
 */
public class CodeJam {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {

       
       BufferedReader bf = new BufferedReader(new FileReader("B-large.in"));
       int n = Integer.parseInt(bf.readLine());
       PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
       
       for (int i = 0;i < n;i++){
           int count = 0;
           int uses = 0;
           String[] s = bf.readLine().split(" ");
           int N = Integer.parseInt(s[0]);
           int S = Integer.parseInt(s[1]);
           int p = Integer.parseInt(s[2]);
           
           for (int j = 0; j < N; j++) {
               int v = Integer.parseInt(s[j+3]);
               
               int a[] = new int[3];
               
               for (int k = 0; k < 2; k++) {
                   a[k] = v/(3-k);
                   v-=a[k];
               }
               
               a[2] = v;
               
               Arrays.sort(a);
               
               if (a[2] >= p){
                   count++;
                   continue;
               }
               
               if (uses < S){
                   if (a[2] == a[1] && a[1] !=0)
                       if (a[2]+1 >= p){
                           count++;
                           uses++;
                       }
                   
               }

               }
           
           pw.println("Case #"+(i+1)+": "+count);
           }
           
       
       
       pw.flush();;
       pw.close();
       
       
    }
}
