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.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		
		for(int t=1; t<=T; t++){
			int N=sc.nextInt();
			int S=sc.nextInt();
			int P=sc.nextInt();
			int P1 = P-1<0 ? 0 : P-1;
			int P2 = P-2<0 ? 0 : P-2;
			
			int[] sum = new int[N];
			for(int i=0; i<N; i++)
				sum[i] = sc.nextInt();
			
			int out = 0;
			for(int i=0; i<N; i++)
				if(sum[i] >= 2*P1+P) {
					out++;
					sum[i] = -1;
				}
			for(int i=0; i<N && S>0; i++)
				if(sum[i] >= 2*P2+P){
					S--;
					sum[i] = -1;
					out++;
				}
			System.out.println("Case #"+t+": "+out);
		}
	}

}
