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 qualifyingRound;

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

public class DancingWithGooglers {
	public static void main (String [] args) throws FileNotFoundException
	{
		Scanner in = new Scanner (new File ("input.txt"));
		int numLines = Integer.parseInt(in.nextLine());
		int caseNum = 1;
		for (int j = 0; j < numLines; j++)
		{	
			System.out.print("Case #" + caseNum + ": ");
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int noSup = 0;
			int sup = 0;
			for (int i = 0; i < n; i++)
			{
				int total = in.nextInt();
				int maxNoSup = maxNoSup(total);
				int maxSup = maxSup(total);
//				System.out.println(total + " " + maxNoSup + " " + maxSup);
				if (maxNoSup >= p)
					noSup++;
				else if (maxSup >= p)
					sup++;
			}
			int temp = s - sup;
			if (temp <= 0)
				System.out.println((noSup + s));
			else
				System.out.println((noSup + (sup)));
			caseNum++;
		}
	}
	private static int maxNoSup(int totalScore)
	{
		int i = totalScore % 3;
		switch (i)
		{
		case 0: return totalScore/3;
		case 1: return totalScore/3 + 1;
		default: return totalScore/3 + 1;
		}
	}
	private static int maxSup(int totalScore)
	{
		if (totalScore == 0)
			return 0;
		int i = totalScore % 3;
		switch (i)
		{
		case 0: return totalScore/3 + 1;
		case 1: return totalScore/3 + 1;
		default: return totalScore/3 + 2;
		}
	}
}
