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 B {
	
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt(); in.nextLine();		
		
		//build auxiliary arrays
		int[] without = new int[31];
		int[] with = new int[31];
		for (int i = 0; i <= 30; i++)
		{
			without[i] = (int)Math.ceil((double)i/3.0);
			
			if (i == 0) with[i] = 0;
			else with[i] = (int)Math.min(10, Math.ceil(((double)i+2.0)/3.0));
		}	
		
		//for each test case
		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 tp = in.nextInt();
				
				if (without[tp] >= p) result++;
				else if (with[tp] >= p && S > 0)
				{
					result++;
					S--;
				}
			}			
			
			System.out.format("Case #%d: %d\n", i, result);
		}
	}
}