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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class B {

	PrintWriter out;

	public void read() throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		out = new PrintWriter(new FileWriter("B-large.out"));
		int n = Integer.parseInt(br.readLine());
		int i = 0;
		String line;
		while (i < n) {
			line = br.readLine();
			solve(i + 1, line);

			i++;
		}

		out.close();
		out.flush();
	}

	public void solve(int c, String line) {

		int max = 0;
		String[] tokens = line.split(" ");
		out.print("Case #" + c + ": ");

		List<Integer> t = new ArrayList<Integer>();
		Integer N = Integer.parseInt(tokens[0]);
		Integer S = Integer.parseInt(tokens[1]);
		Integer p = Integer.parseInt(tokens[2]);

		
			for (int i = 3; i < (N + 3); i++) {
				if (Integer.parseInt(tokens[i]) >= p)
					t.add(Integer.parseInt(tokens[i]));
			}
			
			for (int x = 0; x < t.size(); x++) {
				int sub = t.get(x) - p;

				if (sub >= (2 * p)) {
					max = max + 1;
				} else {
					if (p + (p - 1) > sub) {
						if ((p - 1) + (p - 1) > sub) {
							if (S > 0) {
								if ((p - 2) + p > sub) {
									if ((p - 2) + (p - 1) > sub) {
										if ((p - 2) + (p - 2) > sub) {
											continue;
										} else if ((p - 2) + (p - 2) == sub) {
											max = max + 1;
											S = S - 1;
										}
									} else if ((p - 2) + (p - 1) == sub) {
										max = max + 1;
										S = S - 1;
									}
								} else if ((p - 2) + p == sub) {
									max = max + 1;
									S = S - 1;
								}
							}
						} else if ((p - 1) + (p - 1) == sub) {
							max = max + 1;
						}
					} else if (p + (p - 1) == sub) {
						max = max + 1;
					}
				}
			}
		

		out.print(max);
		out.println();
	}

	public static void main(String[] args) throws IOException {
		new B().read();
	}
}
