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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class ProbB {

    public static void main(String[] args) throws Exception {
        FileReader fr = new FileReader("B-large.in");
        BufferedReader br = new BufferedReader(fr);

        FileWriter fw = new FileWriter("outB.txt");
        BufferedWriter bw = new BufferedWriter(fw);

        String a = br.readLine();
        int cases = Integer.parseInt(a);
        
        int n=0, s=0, p=0, num=0;
        
        for (int i = 1; i < cases+1; i++) {
            String testCase = br.readLine();
            String tokens[] = testCase.split(" ");
            n= Integer.parseInt(tokens[0]);
            s = Integer.parseInt(tokens[1]);
            p = Integer.parseInt(tokens[2]);
            
            int count = 0;
            for (int j = 3; j < n + 3; j++) {
                num = Integer.parseInt(tokens[j]);
                if ((num - p) >= 2 * (p - 1) && (num - p) >= 0) {
                    count++;
                } else if ((num - p) < 2 * (p - 1) && (num - p) >= 0) {
                    if (s != 0 && (num - p) >= 2 * (p - 2)) {
                        count++;
                        s--;
                    }
                }
            }
            String result = "Case #" + (i) + ": " + count;
            bw.write(result);
            bw.newLine();

        }

        bw.close();
        fw.close();

        br.close();
        fr.close();
    }
}
