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 DancingWithGooglers {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int numberOfTests = Integer.parseInt(in.nextLine());
		
		for(int i = 0; i < numberOfTests; i++) {
			int googlers = in.nextInt(), suprises = in.nextInt(), query = in.nextInt();
			int numberSatisfyingQuery = 0, numberNeedingSuprises = 0;
			for(int j = 0; j < googlers; j++) {
				int total = in.nextInt();
				if(total % 3 == 0) {
					int high = total / 3;
					if(high >= query) {
						numberSatisfyingQuery++;
					} else if(high + 1 >= query && high >= 1) {
						numberNeedingSuprises++;
					}
				} else if(total % 3 == 1) {
					int high = total / 3 + 1;
					if(high >= query) {
						numberSatisfyingQuery++;
					} // Surprise not possible
				} else if(total % 3 == 2) {
					int high = total / 3 + 1;
					if(high >= query) {
						numberSatisfyingQuery++;
					} else if(high + 1 >= query && high >= 1) {
						numberNeedingSuprises++;
					}
				}
			}
			int result = numberSatisfyingQuery + Math.min(numberNeedingSuprises, suprises);
			System.out.println("Case #" + (i + 1) + ": " + result);
		}
	}
}