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.util.Scanner;

public class Dancing {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] array = new int[n];
		for (int i = 0; i < n; i++) {
			int k = scan.nextInt();
			int[] arrayInt = new int[k];
			int s = scan.nextInt();
			int p = scan.nextInt();
			for (int j = 0; j < k; j++)
				arrayInt[j] = scan.nextInt();
			int a = 0;
			for (int j = 0; j < k; j++) {
				int div = arrayInt[j] / 3;
				int rem = arrayInt[j] - div * 3;
				if (rem == 0) {
					if (div >= p)
						a++;
					else if (div == p - 1 && s >= 1 && div - 1 >= 0) {
						a++;
						s--;
					}
				} else if (rem == 1) {
					if (div >= p - 1)
						a++;
				} else {
					if (div >= p - 1)
						a++;
					else if (div == p - 2 && s >= 1) {
						a++;
						s--;
					}
				}
			}
			array[i] = a;
		}
		for (int i = 1; i <= n; i++)
			System.out.println("Case #" + i + ": " + array[i - 1]);
	}
}
