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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.StringTokenizer;

public class B {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		int n; // # googlers
		int s; // surprising
		int p; // score
		int scores[];
		int max;
		int min;
		int ret;

		BufferedReader br = new BufferedReader(new FileReader("b.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("b.out"));
		StringTokenizer tk;

		int tests = Integer.parseInt(br.readLine().trim());

		for (int t = 1; t <= tests; t++) {
			tk = new StringTokenizer(br.readLine());
			n = Integer.parseInt(tk.nextToken());
			s = Integer.parseInt(tk.nextToken());
			p = Integer.parseInt(tk.nextToken());

			max = 3 * p - 2;
			min = 3 * p - 4;

			ret = 0;
			scores = new int[n];
			for (int j = 0; j < scores.length; j++)
				scores[j] = Integer.parseInt(tk.nextToken());

			Arrays.sort(scores);

			if (p >= 2)
				for (int i = scores.length - 1; i >= 0; i--) {
					if (scores[i] >= max)
						ret++;
					else if (scores[i] < min)
						break;
					else {
						
						if (s==0)break;
						ret++;
						s--;
					}
				}

			else {
				if (p == 0)
					ret += scores.length;
				else
					for (int i = scores.length-1; i>=0; i--) {
						if (scores[i] > 0)
							ret++;
						else
							break;
					}

			}

//			System.out.println("Case #" + t + ": " + ret);
			bw.write("Case #" + t + ": " + ret);
			bw.newLine();

		}

		bw.close();
	}

}
