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 com.google.codejam;

import com.google.codejam.util.CodeJamInputFile;
import com.google.codejam.util.CodeJamOutputFile;

public class Dancer {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		CodeJamInputFile f = new CodeJamInputFile("in/B-large.in");
		
		CodeJamOutputFile fo = new CodeJamOutputFile("out/B-large.out");
		
		for(int c = 0; c < f.getCases(); c++){
			int count = 0;
			String line = f.getLine();
			String[] tokens = line.split(" ");
			int goog = Integer.valueOf(tokens[0]);
			int surp = Integer.valueOf(tokens[1]);
			int best = Integer.valueOf(tokens[2]);
			for(int g = 3; g < (goog + 3); g++){
				int tot = Integer.valueOf(tokens[g]);
				System.out.print(tot + " - ");
				if(tot > ((best * 3) - 3)){
					count++;
					continue;
				}
				if((surp > 0) && (tot > ((best * 3) - 5)) && (tot > 2)){
					count++;
					surp--;
				}
			}
			System.out.println(count + "");
			fo.writeCase(c, count + "");
		}
		
		f.close();
		fo.close();
	}

}
