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 qualification.taskB;

public class Task {

	private int T;
	private int S;
	private int P;
	private int[] googlers;

	public Task(int t, int s, int p, int[] googlers) {
		super();
		T = t;
		S = s;
		P = p;
		this.googlers = googlers;
	}

	public String execute() {
		int result = 0;
		for (int googler : googlers) {
			int mod = googler % 3;
			int div = (googler - mod) / 3;
			if (googler != 0) {
				if (div >= P) {
					result++;
				} else if ((P - div) == 1 && mod >= 1) {
					result++;
				} else if ((P - div) == 2 && mod == 2 && S > 0) {
					S--;
					result++;
				} else if ((P - div) == 1 && mod == 0 && S > 0) {
					S--;
					result++;
				}
			} else {
				if(P == 0){
					result++;
				}
			}
		}
		return result + "";
	}

}
