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 teardrop.jam2012.qr.dancing;

import org.testng.annotations.Test;

import java.io.Reader;
import java.io.StringReader;
import java.io.StringWriter;
import java.io.Writer;

public class SetSolverTest {
	private static final String testInput =
		"4\n" +
        "3 1 5 15 13 11\n" +
        "3 0 8 23 22 21\n" +
        "2 1 1 8 0\n" +
        "6 2 8 29 20 8 18 18 21";
	private static final String testOutput =
		"Case #1: 3\n" +
        "Case #2: 2\n" +
        "Case #3: 1\n" +
        "Case #4: 3\n";

	@Test
	public void testSolve() throws Exception {
		Reader reader = new StringReader(testInput);
		Writer writer = new StringWriter();
		SetSolver solver = new SetSolver(reader, writer);
		solver.solve();
		String result = writer.toString();
		assert testOutput.equals(result) : String.format("Got \n%s\ninstead of \n%s\n", result, testOutput);
	}
}
