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;
  }
}

package gcj2012;

import java.io.FileInputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class B {

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

	void run() throws Exception {
		Scanner in = new Scanner(System.in);
		in = new Scanner(new FileInputStream("B-large.in"));
		PrintStream out = System.out;
		out = new PrintStream("B-large.out");

		int T = in.nextInt();
		for (int x = 1; x <= T; x++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int t[] = new int[N];
			for (int i = 0; i < t.length; i++)
				t[i] = in.nextInt();
			out.printf("Case #%d: %d\n", x, countAtLeastP(t, p, S));
		}

	}

	int countAtLeastP(int[] t, int p, int s) {
		int canN = 0;
		int canS = 0;
		for (int i : t)
			if (canAtLeastPNonSurprising(i, p)) canN++;
			else if (canAtLeastPSurprising(i, p)) canS++;
		return (canN ) + Math.min(canS, s);
	}

	// min total score with best ind score of p is p + (p-1) + (p-1)
	boolean canAtLeastPNonSurprising(int s, int p) {
		return s >= 3 * p - 2;
	}

	// min surp total score with best ind score of p is p + (p-2) + (p-2)
	boolean canAtLeastPSurprising(int s, int p) {
		if (s < 2) return false;
		return s >= 3 * p - 4;
	}

}
