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 DWtG {

	static int T,N,S,P;
	static int[] t = new int[1000];
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = Integer.parseInt(sc.nextLine());
		for (int k = 0; k<T; k++)
		{
			int result = 0;
			N = sc.nextInt();
			S = sc.nextInt();
			P = sc.nextInt();
			for (int i =0; i<N; i++)
			{
				t[i] = sc.nextInt();
				int base =(int) t[i]/3;
				switch (t[i]%3)
				{
				case 0:
				{
					if (base >= P) result++;
					else
					{
						if (S > 0 && base > 0 && base+1>=P)
						{
							result++;
							S--;
						}
					}
					break;
				}
				case 1:
				{
					if (base >= P || base+1 >= P) result++;
					else
					{
						if (S > 0 && base+1 >=P) 
						{
							result ++;
							S--;
						}
					}
					break;
				}
				case 2:
				{
					if (base + 1 >= P || base >= P) result ++;
			          else
			          {
			            if (S > 0 && base + 2 >= P)
			            {
			              result++;
			              S--;
			            }
			          }

					break;
				}
				}
			}
			System.out.println("Case #" + (k+1) + ": " + result);
		}
	}

}
