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 com.google.codejam;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class GooglerDanceSolver {

	public static int getMaximumPassCount(int passScore, int surpriseCount, List<Integer> scores) {
		int passCount = 0;

		int lowerBound = (passScore > 1) ? 3 * passScore - 4 : passScore;
		
		for (int score : scores) {
			if (score < lowerBound) {
				continue;
			} else if (score > 3 * passScore - 3) {
				passCount++;
			} else if (surpriseCount > 0) {
				passCount++;
				surpriseCount--;
			}
		}
		
		return passCount;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int totalCount = Integer.parseInt(scanner.nextLine());
		
		for (int i = 0; i < totalCount; i++) {
			String[] inputs = scanner.nextLine().split(" ");
			int n = Integer.parseInt(inputs[0]);
			int s = Integer.parseInt(inputs[1]);
			int p = Integer.parseInt(inputs[2]);
			List<Integer> scores = new ArrayList<Integer>(n);
			for (int j = 0; j < n; j++) {
				scores.add(Integer.parseInt(inputs[j+3]));
			}
			int answer = GooglerDanceSolver.getMaximumPassCount(p, s, scores);
			System.out.printf("Case #%d: %d%n", i+1, answer);
			//System.err.printf("[Debug Info] p=%d, s=%d, scores=%s%n", p, s, scores.toString());
		}
	}

}
