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 question;

import java.util.HashMap;

import utils.FileTools;

public class Qualification2 {
	public static void main(String[] args) {
		try {
			FileTools ft = new FileTools("B-large.in");
			int T = Integer.parseInt(ft.in.readLine());
			String line;
			int l = 0;
			while ((line = ft.in.readLine()) != null) {
				ft.out.write("Case #" + (++l) + ": ");
				String[] a = line.split(" ");
				int total = 0;
				int size = Integer.parseInt(a[0]);
				int sur = Integer.parseInt(a[1]);
				int avr = Integer.parseInt(a[2]);
				for (int i = 0; i < size; i++) {
					int v = Integer.parseInt(a[i + 3]);
					if (v >= avr && v >= 3 * avr - 2) {
						total++;
					} else if (sur > 0 && v >= avr && v >= avr * 3 - 4) {
						sur--;
						total++;
					}
				}
				ft.out.write(Integer.valueOf(total).toString());
				System.out.println("Case #" + l + ": " + total);
				ft.out.newLine();
			}
			ft.out.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
