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 DanceGoogler {

    public static void main(String[] args) {
        DanceGoogler d = new DanceGoogler();
        Scanner in = new Scanner(System.in);
        int cases = in.nextInt();
        for (int i = 0; i < cases; i++) {
            System.out.printf("Case #%d: %d\n", i+1, d.solve(in));
        }
    }
    
    private int solve(Scanner in) {
	int N = in.nextInt();
	int S = in.nextInt();
	int p = in.nextInt();
	int[] scores = new int[N];
	for (int i = 0; i < N; i++) scores[i] = in.nextInt();
	int count = 0;
	for (int i = 0; i < scores.length; i++) {
	    if (scores[i] < p) continue;
	    double diff = p - (scores[i] - p) / 2.0;
	    if (diff > 2.0) continue;
	    if (diff > 1.0) {
		if (S > 0) {
		    S--;
		    count++;
		}
		else continue;
	    }
	    else count++;
	}
	return count;
    }

}