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;
  }
}

package twentytwelve.qualification.b;

import java.util.Scanner;

public final class DancingWithTheGooglers {

    /**
     * @param args
     */
    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int cases = sc.nextInt();
	for (int no = 1; no <= cases; no++) {
	    System.out.print("Case #" + no + ": ");
	    // googlers
	    int N = sc.nextInt();
	    // surprises
	    int S = sc.nextInt();
	    // best result
	    int p = sc.nextInt();

	    // unnecessary calculations
	    int p2 = 3 * p - 2;
	    int p4 = p2 - 2;

	    int max = 0;
	    for (int triplet = 0; triplet < N; triplet++) {
		int score = sc.nextInt();
		if (score >= p) {
		    if (score >= p2) {
			max++;
		    } else if (score < p2 && score >= p4 && S > 0) {
			max++;
			S--;
		    }
		}
	    }
	    System.out.println(max);
	}
    }
}
