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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class DancingWithGooglers {

	private static int N;
	private static int S;
	private static int p;
	private static int[] ts;
	private static int[][] memo;
	private static int[] maxSupr;
	private static int[] maxNotSupr;

	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new File("inputB.txt"));
		PrintWriter pw = new PrintWriter("outputB.txt");
		int T = sc.nextInt();

		maxSupr = new int[31];
		Arrays.fill(maxSupr, -1);
		maxNotSupr = new int[31];
		Arrays.fill(maxNotSupr, -1);

		for (int a = 0; a <= 10; a++) {
			for (int b = 0; b <= 10; b++) {
				for (int c = 0; c <= 10; c++) {
					int s = a + b + c;
					if (Math.abs(a - b) <= 2 && Math.abs(b - c) <= 2 && Math.abs(c - a) <= 2) {
						int max = Math.max(a, Math.max(b, c));
						if (Math.abs(a - b) == 2 || Math.abs(b - c) == 2 || Math.abs(c - a) == 2) {
							maxSupr[s] = Math.max(maxSupr[s], max);
						} else {
							maxNotSupr[s] = Math.max(maxNotSupr[s], max);
						}
					}
				}
			}
		}

		for (int t = 1; t <= T; t++) {
			N = sc.nextInt();
			S = sc.nextInt();
			p = sc.nextInt();
			ts = new int[N];
			for (int i = 0; i < ts.length; i++) {
				ts[i] = sc.nextInt();
			}

			memo = new int[N + 1][S + 1];
			for (int[] m : memo) {
				Arrays.fill(m, -1);
			}

			int max = getMax(0, S);
			pw.println("Case #" + t + ": " + max);
		}
		pw.flush();
		pw.close();
	}

	public static int getMax(int index, int surpr) {
		int res = memo[index][surpr];
		if (res == -1) {
			if (index == N) {
				if (surpr == 0) {
					res = 0;
				} else {
					res = -1000;
				}
			} else {
				// not suprised
				res = (maxNotSupr[ts[index]] >= p ? 1 : 0) + getMax(index + 1, surpr);

				if (surpr > 0 && maxSupr[ts[index]] != -1) {
					// suprised
					res = Math.max(res, (maxSupr[ts[index]] >= p ? 1 : 0) + getMax(index + 1, surpr - 1));
				}

			}
			memo[index][surpr] = res;
		}
		return res;
	}
}
