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;
  }
}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;


public class Dance {
	private File file = new File("D:\\Sources\\GoogleCodeJam\\files\\B-large.in");
	private File outFile = new File("D:\\Sources\\GoogleCodeJam\\files\\result.out");
	
	private Integer[] results;
	private Integer solved = 0;
	
	public void readData() {
		boolean first = true;
		Scanner scanner;
		try {
			scanner = new Scanner(file);
			while (scanner.hasNextLine()) {
				String line = scanner.nextLine();
				Scanner scan = new Scanner(line);
				if (first) {
					results = new Integer[scan.nextInt()];
					first = false;
				} else {
					int[] googlers = new int[scan.nextInt()];
					int sup = scan.nextInt();
					int above = scan.nextInt();
					for (int i = 0; i < googlers.length; i++) {
						googlers[i] = scan.nextInt();
					}
					results[solved] = solveProblem(googlers, sup, above);
					solved++;
				}
			}
			printResult();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	private Integer solveProblem(int[] googlers, int sup, int above) {
		if(above == 0)
			return googlers.length;
		int notSup = 0;
		int suprising = 0;
		for (int i = 0; i < googlers.length; i++) {
			if(above * 3 - 2 <= googlers[i]) {
				notSup++;
			} else if(above > 1 && above * 3 - 4 <= googlers[i]) {
				suprising++;
			}
		}
		
		return suprising > sup ? notSup + sup : notSup + suprising;
	}

	private void printResult() {
		try {
			FileWriter fstream = new FileWriter(outFile);
			BufferedWriter out = new BufferedWriter(fstream);
			for (int i = 0; i < results.length; i++) {
				out.write("Case #" + (i + 1) + ": " + results[i]);
				out.newLine();
			}
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
