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.io.*;
import java.util.Scanner;

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

/**
 *
 * @author joshuahm
 */
public class codejamB {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        FileReader inFile = new FileReader("B-large.in");
        Scanner in = new Scanner(inFile);
        FileWriter outFile = new FileWriter("B-large.out");
        PrintWriter out = new PrintWriter(outFile);
        int T= in.nextInt();
        for(int k=0;k<T;k++)
        {
            int N= in.nextInt();
            int S= in.nextInt();
            int p= in.nextInt();
            int[] total= new int[N];
            for(int i=0;i<N;i++)
                total[i]= in.nextInt();
            int possible=0;
            int surprising=0;
            for(int i=0;i<N;i++)
            {
                if(total[i]>3*p-3)
                    possible++;
                else if(total[i]>Math.max(3*p-5,0))
                    surprising++;
            }
            out.println("Case #"+ (k+1) +": "  + (possible + Math.min(surprising, S)));
        }
        in.close();
        out.close();
    }
}
