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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		Scanner input = new Scanner(new File("B-large.in"));
		FileWriter out = new FileWriter("out.txt");

		int lineNumber = input.nextInt();
		input.nextLine();
		for (int i = 0; i < lineNumber; i++) {
			String solution = "Case #" + (i + 1) + ": ";
			int n = input.nextInt();
			int s = input.nextInt();
			int p = input.nextInt();
			int max = 0;
			int upperLimit = p * 3 - 2;
			int lowerLimit = p * 3 - 4;
			for (int j = 0; j < n; j++) {
				int sum = input.nextInt();
				if (p == 1 && sum >= 1) {
					max++;
				} else if (sum >= upperLimit && sum>p) {
					max++;
				} else if (sum >= lowerLimit && s > 0 && sum>p) {
					s--;
					max++;
				}
			}
			if(p==0)
				max = n;
			solution += max;
			solution += System.getProperty("line.separator");
			;
			out.write(solution);
		}

		out.close();
		input.close();
	}

}
