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.codejam2012.qual.b;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

public class DancingWithTheGooglers {

    /**
     * @param args
     * @throws IOException 
     */
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new FileReader("2012/qualB/input.txt"));
        PrintWriter writer = new PrintWriter(new BufferedWriter(new FileWriter("2012/qualB/output.txt")));

        int numberOfTests = Integer.parseInt(reader.readLine()); // T

        for (int i = 0; i < numberOfTests; i++) {
            System.out.println(i);
            String[] testCase = reader.readLine().split(" ");
            int numberOfGooglers = Integer.parseInt(testCase[0]); // N
            int numberOfSurprisingTriplets = Integer.parseInt(testCase[1]); // S
            int minBestResult = Integer.parseInt(testCase[2]); // p
            //int[] totalPoints = new int[numberOfGooglers];
        	int countOk = 0, surprises = 0;
        	if (minBestResult == 0) {
        		countOk = numberOfGooglers;
        	} else {
	            for (int j = 0; j < numberOfGooglers; j++) {
	            	int totalPoints = Integer.parseInt(testCase[j + 3]); // ti
	            	int minTotal = minBestResult + (2 * (minBestResult - 1));
	            	if (totalPoints >= minTotal) {
	            		// ok without surprise
	            		countOk++;
	            	} else if (minBestResult > 1) {
	            		minTotal = minBestResult + (2 * (minBestResult - 2));
	            		if (totalPoints >= minTotal) {
		            		// ok with surprise
		            		surprises++;
		            		if (surprises <= numberOfSurprisingTriplets) {
		            			countOk++;
		            		}
	            		}
	            	}
	            }
        	}

            writer.println("Case #" + (i + 1) + ": " + countOk);
        }

        writer.flush();
        writer.close();
        reader.close();
    }

}
