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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class BDanceWithGooglers {

	public static void solve() throws IOException {
		File f = new File("E:\\downloads\\B-large.in");
		BufferedReader reader = new BufferedReader(new FileReader(f));
		File f2 = new File("C:\\Users\\kimo\\Desktop\\out.txt");
		BufferedWriter writer = new BufferedWriter(new FileWriter(f2));
		int x = Integer.parseInt(reader.readLine());
		int a[] = null;
		String st[] = null;
		for (int i = 0; i < x; i++) {
			st = reader.readLine().split(" ");
			a = new int[st.length];
			for (int j = 0; j < st.length; j++)
				a[j] = Integer.parseInt(st[j]);

			int s = a[1];
			int p = a[2];
			int count = 0;
			int exact = p + p - 1 + p - 1;
			int surp = p + p - 2 + p - 2;
			for (int k = 3; k < a.length; k++)
				if (a[k] / 3 >= p || a[k] >= exact&&a[k]>=p)
					count++;
				else

				if (a[k] >= surp && s-- > 0&&a[k]>=p)
					count++;
			writer.write("Case #" + (i + 1) + ": " + count);
			writer.newLine();
			
		}
		reader.close();
		writer.close();
	}

	public static void main(String[] args) throws IOException {
		solve();

	}

}
