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 y2012.quals;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new File("B.in"));
		PrintWriter out = new PrintWriter(new File("B.out"));
		int nTestCase = in.nextInt();
		for (int testCase = 0; testCase < nTestCase; testCase++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = in.nextInt();
			int res = 0;
			int rl = p + p - 1 + p - 1, sl = p + p - 2 + p - 2;
			if (p == 0) {
				rl = 0;
				sl = 0;
			} else if (p == 1)
				sl = 1;
			for (int i = 0; i < n; i++)
				if (a[i] >= rl)
					res++;
				else if (a[i] >= sl && s > 0) {
					res++;
					s--;
				}

			out.println("Case #" + (testCase + 1) + ": " + res);
		}
		in.close();
		out.close();
	}
}
