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;

class DancingGooglers{
    public static void main(String[] args)
    throws Exception{
        BufferedReader br = new BufferedReader(new FileReader("in.in"));
        BufferedWriter bw = new BufferedWriter(new FileWriter("out.txt"));
        int T = Integer.parseInt(br.readLine());

        for(int i=0; i<T; i++){
            String in = br.readLine();
            String[] inp = in.split(" ", 4);
            int N = Integer.parseInt(inp[0]);
            int S = Integer.parseInt(inp[1]);
            int p = Integer.parseInt(inp[2]);
            int nos = 0;
            String[] input = inp[3].split(" ");
            int[] t = new int[N];
            int[] r = new int[N];
            for(int j=0;j<N;j++){
                t[j] = Integer.parseInt(input[j]);
                r[j] = t[j]%3;
                t[j] /= 3;
                if(t[j] >= p)
                    nos++;
                if(t[j] == p - 1){
                    if(r[j] > 0)
                        nos++;
                    else if(t[j]>0){
                        nos++;
                        S--;
                    }
                }
                if(t[j] == p-2){
                    if(r[j] == 2){
                        nos++;
                        S--;
                    }
                }
            }
            if(S<0)
                nos += S;
            bw.write("Case #"+(i+1)+": "+nos+"\n");
        }
        bw.close();
    }
}