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

public class DancingWithTheGooglers {

	public static void main(String[] args) throws IOException {
		File input = new File("files/B-large.in.txt");
		File output = new File("files/B-large.out.txt");
		PrintWriter pw = new PrintWriter(output);
		Scanner sc = new Scanner(input);
		int T = sc.nextInt();
		for (int i = 0; i < T; i++) {
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int[] t = new int[N];
			for (int j = 0; j < t.length; j++) {
				t[j] = sc.nextInt();
			}
			int answer = solve(N, S, p, t);
			pw.println(String.format("Case #%d: %d", i + 1, answer));
		}
		pw.close();
		sc.close();
	}

	static int solve(int n, int s, int p, int[] t) {
		if (p == 0) {
			return t.length;
		}
		
		int count = 0;
		for (int i = 0; i < t.length; i++) {
			if (t[i] >= (3 * p) - 2) {
				count++;
			} else if (s > 0 && t[i] > 0 && t[i] >= (3 * p) - 4) {
				count++;
				s--;
			}
		}
		return count;
	}
}
