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 org.moriraaca.codejam.dancingwithgooglers;

import org.moriraaca.codejam.AbstractSolver;
import org.moriraaca.codejam.SolverConfiguration;

@SolverConfiguration(parser = DancingWithTheGooglersDataParser.class)
public class DancingWithTheGooglersSolver extends
		AbstractSolver<DancingWithTheGooglersTestCase> {

	public static void main(String[] args) {
		new DancingWithTheGooglersSolver().getSolution();
	}

	private int cdiv(int n, int d) {
		return (n % d == 0 ? n / d : n / d + 1);
	}

	@Override
	protected String solveTestCase(DancingWithTheGooglersTestCase testCase) {
		int counter = 0;

		for (int i = 0; i < testCase.scores.length; i++) {
			int max = cdiv(testCase.scores[i], 3);
			
			if (max >= testCase.p) {
				counter++;
			} else if (testCase.scores[i] > 1 && testCase.scores[i] % 3 != 1 && max + 1 >= testCase.p
					&& testCase.S > 0) {
				counter++;
				testCase.S--;
			}
			
		}
		
		return String.valueOf(counter);
	}
}
