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 Solution {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		int N, S, p, sure, av, note, result;
		
		for(int zz = 1; zz <= T;zz++){
			result=0;
			N = in.nextInt();
			S = in.nextInt();
			p =  in.nextInt();
			sure = p + (p-1) + (p-1);
			if (sure < p)
				sure =p;
			av = p + (p-2) + (p-2);
			if (av < p)
				av = p;
			for (int i = 1; i <= N; i++){
				note = in.nextInt();
				if (note >= sure){
					result++;
				} else if (( note < sure ) && (note >= av)){
					if (S > 0){
						S--;
						result++;
					}
				}
			}
			in.nextLine();
			System.out.format("Case #%d: %d\n",zz, result);
		}
	}
}
