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.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
public class GooglersDance {
	static int output = 0;
	static int numberOfDancers = 0;
	static int surprise = 0;
	static int bestResult = 0;

	public static void main(String[] args) {
		try {

			InputStreamReader isr = new InputStreamReader(System.in);
			BufferedReader reader = new BufferedReader(new FileReader("e:/B-small-attempt0.in"));
			int totalLines = Integer.parseInt(reader.readLine());
			for(int k=0;k<totalLines;k++)
			{
				String[] input = reader.readLine().split(" ");
				numberOfDancers = Integer.parseInt(input[0]);
				surprise = Integer.parseInt(input[1]);
				bestResult = Integer.parseInt(input[2]);
				output = 0;
				
				int [] totalPoints = new int[numberOfDancers];
				for (int i = 0; i < totalPoints.length; i++) {
					totalPoints[i] = Integer.parseInt(input[3+i]);
					isBestReesult(totalPoints[i]);
				}
				System.out.println("Case #" + (k+1) + ": " + output);
			}
		} catch (Exception ex) {
			System.out.println(ex);
		}
	}

	private static void isBestReesult(int i) {
		int av = i/3;
		int rem = i%3;

		if(av+2 < bestResult)
			return;

		if(rem == 0)
		{
			if(av >= bestResult)
			{
				output++;
			}else if(av+1 >= bestResult && av+1 <= i && surprise > 0)
			{
				output++;
				surprise--;
			}
		}else if(rem == 1)
		{
			if((av >= bestResult || av+1 >= bestResult) && av+1 <= i)
				output++;
		}else
		{
			if((av >= bestResult || av+1 >= bestResult) && av+1 <= i )
			{
				output++;
			}else if(av+2 >= bestResult && surprise > 0 && av+1 <= i )
			{
				output++;
				surprise--;
			}
		}
	}
}
