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

public class Dancing {
	private static Scanner s = new Scanner(System.in);

	public static void main(String[] args) {
		int T = s.nextInt();

		for (int t = 0; t < T; t++) {
			int N = s.nextInt();
			int S = s.nextInt();
			int p = s.nextInt();

			int[] sums = new int[N];
			boolean[] satisfied = new boolean[N];

			for (int i = 0; i < N; i++) sums[i] = s.nextInt();

			for (int i = 0; i < N; i++) {
				int low = Math.max(p - 1, 0);
				if (p + low * 2 > sums[i]) continue;
				satisfied[i] = true;
			}

			for (int i = 0; i < N; i++) {
				if (S == 0) break;
				if (satisfied[i]) continue;
				int low = Math.max(p - 2, 0);
				if (p + low * 2 > sums[i]) continue;
				satisfied[i] = true;
				S--;
			}

			int max = 0;
			for (int i = 0; i < N; i++)
				if (satisfied[i])
					max++;

			System.out.printf("Case #%d: %d\n", t + 1, max);
		}
	}
}
