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 rounds.qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class B_dancing_with_the_googlers {

	public static void main(String[] args) throws IOException {

		BufferedReader reader = null;
		BufferedWriter writer = null;
		
		try {
			reader = new BufferedReader(new FileReader("./input"));
			writer = new BufferedWriter(new FileWriter("output"));
			int numberOfCases = Integer.valueOf(reader.readLine());
			for (int i = 1; i <= numberOfCases; i++) {
				String line = reader.readLine();
				StringBuilder sb = new StringBuilder("Case #" + i + ": ");
				Scanner scanner = new Scanner(line);
				int result = 0;
				while(scanner.hasNextInt()) {
					int numberOfGooglers = scanner.nextInt();
					int numberOfSurprisings = scanner.nextInt();
					int scoreToReach = scanner.nextInt();
					
					while(numberOfGooglers>0) {
						int googlerScore = scanner.nextInt();
						int div = googlerScore/3;
						int mod =( googlerScore % 3 == 0) ? 0 : 1;
						int highest =  div + mod;
						if(highest>=scoreToReach) {
							result++;
						}
						else if(googlerScore > 0 && highest+1 == scoreToReach && numberOfSurprisings > 0) {
							result++;
							numberOfSurprisings--;
						}
						numberOfGooglers--;
					}
					sb.append(result);
				}
				sb.append("\n");
				writer.write(sb.toString());
			}
		} finally {
			if (reader != null) {
				reader.close();
			}
			if(writer!=null) {
				writer.flush();
				writer.close();
			}
		}
	}

	
}
