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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;

public class GoogleDancers {

	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new File("input.txt"));
		BufferedWriter out = null;
		try {
			FileWriter fstream = new FileWriter("out.txt");
			out = new BufferedWriter(fstream);
			int cases = in.nextInt();
			for (int i = 0; i < (cases); i++) {
				int result = 0;
				int n = in.nextInt();
				int s = in.nextInt();
				int tempS = s;
				int possSup = 0;
				int p = in.nextInt();
				for (int j = 0; j < n; j++) {
					int current = in.nextInt();
					int div = current / 3;
					int mod = current % 3;
					switch (mod) {
					case 0:
						if (div >= p) {
							result++;
							if (div + 1 < 11)
								possSup++;
						} else if (div != 0 && div + 1 >= p) {
							result++;
							tempS--;
						} else if (div != 0) {
							possSup++;
						}
						break;
					case 1:
						if (div + 1 >= p) {
							result++;
						}
						possSup++;
						break;
					case 2:
						if (div + 1 >= p) {
							result++;
							if (div + 2 < 11)
								possSup++;
						} else if (div + 2 >= p) {
							result++;
							tempS--;
						} else
							possSup++;
						break;
					default:
						break;
					}
				}
				if (tempS < 0) {
					result = result + tempS;
				} else if (tempS > 0) {
					if (possSup < tempS)
						result = result - (tempS - possSup);
				}
				System.out.println(result);
				out.write("Case #" + (i + 1) + ": " + result + "\n");
			}
			out.close();
		} catch (Exception e) {// Catch exception if any
			e.printStackTrace();
			System.err.println("Error: " + e.getMessage());
		}
	}
}
