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

import java.util.Arrays;
import java.util.Scanner;

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		new DancingWithTheGooglers().run();
	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int testcase = 0; testcase < T; testcase++) {
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int[] t = new int[N];
			for (int i = 0; i < N; i++) {
				t[i] = sc.nextInt();
			}
			int result = solve(N, S, p, t);
			System.out.printf("Case #%d: %d\n", testcase + 1, result);
		}
	}

	/**
	 * 
	 * @param N the number of Googlers
	 * @param S the number of surprising triplets of scores
	 * @param p
	 * @param t
	 * @return
	 */
	public int solve(int N, int S, int p, int[] t) {
		int result = 0;
		Arrays.sort(t);
		for (int i = N - 1; i >= 0; i--) {
			int b = (t[i] + 2) / 3;
			if (b >= p) {
				result++;
//				System.out.printf("(1) %d : %d\n", t[i], b);
			} else if (t[i] > 1 && S > 0 && b == p - 1 && ((t[i] - 1) % 3) != 0) {
				result++;
				S--;
//				System.out.printf("(2) %d : %d (S=%d)\n", t[i], b, S);
			}
		}
		return result;
	}

}
