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 blacky.codejam.qualifications;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class DancingGoogler {

	public static void main(String args[]) throws NumberFormatException, IOException {
		File file = new File(args[0]);
		BufferedReader reader = new BufferedReader(new FileReader(file));
		int numberOfTestCases = Integer.parseInt(reader.readLine());
		for(int i = 0; i < numberOfTestCases; i++) {
			StringTokenizer tokenizer = new StringTokenizer(reader.readLine());
			int minimumerGooglers = 0;
			int usedSurprisingTriplets = 0;
			final int numberOfGooglers = Integer.parseInt(tokenizer.nextToken());
			final int surprisingTriplets = Integer.parseInt(tokenizer.nextToken());
			final int bestResultMinimum = Integer.parseInt(tokenizer.nextToken());
			int results[] = new int[numberOfGooglers];
			for(int j = 0; j < numberOfGooglers; j++) {
				results[j] = Integer.parseInt(tokenizer.nextToken()); 
			}
			for(int j = 0; j < numberOfGooglers; j++) {
				boolean possibleSurprising = false;
				boolean possibleNonSurprising = false;
				enumarate:
				for(int judge1 = 0; judge1 <= 10; judge1++) {
					for(int judge2 = judge1 - 2; judge2 <= judge1 + 2; judge2++) {
						for(int judge3 = judge1 - 2; judge3 <= judge1 + 2; judge3++) {
							if(judge1 + judge2 + judge3 == results[j]) {
								if(judge1 < 0 || judge2 < 0 || judge3 < 0) {
									continue; // Illegal case
								} else if(2 < Math.abs(judge1 - judge2) || 2 < Math.abs(judge1 - judge3)|| 2 < Math.abs(judge2 - judge3)) {
									continue; // Illegal case
								} else if (bestResultMinimum <= judge1 || bestResultMinimum <= judge2 || bestResultMinimum <= judge3) {
									if(Math.abs(judge1 - judge2) == 2 || Math.abs(judge1 - judge3) == 2 || Math.abs(judge2 - judge3) == 2) {
										possibleSurprising = true;
									} else {
										possibleNonSurprising = true;
										break enumarate;
									}
								}
							}
						}
					}
				}
				if(possibleNonSurprising) {
					minimumerGooglers++;
				} else if (possibleSurprising && usedSurprisingTriplets < surprisingTriplets) {
					minimumerGooglers++;
					usedSurprisingTriplets++;
				}
			}
			System.out.println(String.format("Case #%d: %d", i + 1, minimumerGooglers));
		}
	}
	
}
