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 er.dream.codejam.train;

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

import er.dream.codejam.helpers.ProblemSolver;

public class DancingWithGooglers extends ProblemSolver{
	
	public static void main(String[] args) {
		new DancingWithGooglers().execute();
	}

	@Override
	protected List<String> handleInput() {
		List<String> result = new ArrayList<String>();
		int[] settings = fileHandler.readIntArray();
		
		for(int i=0;i<settings[0];i++){
			int[] numbers = fileHandler.readIntArray();
			int surprises = numbers[1];
			int minScore = numbers[2];
			
			int minimumScoreForUnsurprising = Math.max(0,3*minScore-2);
			int minimumScoreForSurprising = Math.max(0, 3*minScore-4);
			
			int surprisesMax = 0;
			int unsuprising = 0;
			
			int score;
			for(int j=3;j<numbers.length;j++){
				
				score = numbers[j];
				if(score < minScore)
					continue;
				
				if(score >= minimumScoreForUnsurprising)
					unsuprising++;
				else if(score >= minimumScoreForSurprising)
					surprisesMax++;
			}
			int maxGooglers = unsuprising + Math.min(surprises,  surprisesMax);
			result.add(""+maxGooglers);
		}
		
		return result;
	}

}
