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.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;

public class answer {

	public static int solve(int N, int S, int P, int[] googler) {
		int greater = 0;
		int score;

		for (int i = 0; i < N; i++) {

			score = googler[i];

			if (score / 3 >= P) {
				greater++;
			} else {
				if (score % 3 == 0 && score != 0) {

					if ( score / 3 + 1 >= P && S > 0) {
						S--;
						greater++;
					}
				} else if (score != 0) {
					if ( score / 3 + 1 >= P) {
						greater++;
					} else if ( score / 3 < P && score / 3 + 2 >= P && S > 0) {
						S--;
						greater++;
					}
				} else if (P == 0) {
					greater++;
				}
			}
		}
		return greater;
	}

	public static void main(String[] args) throws Exception {

		Scanner in = new Scanner(new File("B-large.in"));
		PrintWriter out = new PrintWriter("output.out");

		int[] googler = new int[100];
		int testCases = Integer.parseInt(in.next());
		int count = 0;
		while (in.hasNext()) {
			count++;
			int N = Integer.parseInt(in.next());
			int S = Integer.parseInt(in.next());
			int P = Integer.parseInt(in.next());

			for (int i = 0; i < N; i++) {
				googler[i] = Integer.parseInt(in.next());
			}
			int greater = solve(N, S, P, googler);
			out.printf("Case #%d: %d\n", count, greater);

		}

		out.close();
		in.close();
	}
}
