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

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

public class Qual1b {
	static int[] norm = { 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6,
			6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10 };
	static int[] weird = { 0, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6,
			7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10 };

	public static void main(String args[]) {

		try {
			FileWriter fstream = new FileWriter("outBLarge.txt");
			BufferedWriter out = new BufferedWriter(fstream);
			Scanner scanner = new Scanner(new File("B-large.in"));

			int count = scanner.nextInt();

			for (int i = 1; i <= count; i++) {
				int n = scanner.nextInt();
				int s = scanner.nextInt();
				int p = scanner.nextInt();

				int resultMax = 0;
				for (int j = 0; j < n; j++) {
					int temp = scanner.nextInt();
					if (norm[temp] >= p) {
						resultMax++;
					} else if (weird[temp] >= p && s > 0) {
						resultMax++;
						s--;
					}
				}
				out.write("Case #" + i + ": " + resultMax + "\n");
			}
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
