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

	private static Scanner in = new Scanner(System.in);

	private static void solve(int no) {
		int N = in.nextInt();
		int S = in.nextInt();
		int p = in.nextInt();

		int ans = 0;
		for (int i = 0; i < N; i++) {
			int sum = in.nextInt();
			int avr = sum / 3;
			int rem = sum % 3;
			switch (rem) {
			case 0:
				if (avr >= p) {
					ans++;
				} else if (S > 0 && avr > 0 && avr + 1 >= p) {
					ans++;
					S--;
				}
				break;
			case 1:
				if (avr + 1 >= p) {
					ans++;
				}
				break;
			case 2:
				if (avr + 1 >= p) {
					ans++;
				} else if (S > 0 && avr + 2 >= p) {
					ans++;
					S--;
				}
				break;
			}
		}
		System.out.printf("Case #%d: %d%n", no, ans);
	}

	public static void main(String[] args) {
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			solve(i + 1);
		}
	}

}
