import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

package lt.kasrud.gcj.ex2;

import lt.kasrud.gcj.common.io.Reader;
import lt.kasrud.gcj.common.io.Writer;

import java.io.IOException;
import java.util.*;

public class Main {
  public static void main(String[] args) throws IOException {
    List<String> iData = Reader.readFile("B-small-attempt0.in");
    Writer.writeFile("out2.txt", process(iData.subList(1, iData.size())));
  }

  private static List<String> process(List<String> data) {
    List<String> result = new ArrayList<String>(data.size());
    for(String record : data){
      List<String> tokens = Arrays.asList(record.trim().split(" "));
      result.add(calculate(Integer.valueOf(tokens.get(1)), Integer.valueOf(tokens.get(2)), tokens.subList(3, tokens.size())));
    }

    return result;
  }

  private static String calculate(Integer surpCnt, Integer maxValue, List<String> totPoints) {
    int cnt = 0;
    int minDiff = maxValue > 0 ? 1 : maxValue;
    int maxDiff = maxValue > 1 ? 2 : maxValue;
    int maxTotal = maxValue * 3 - 2 * minDiff;
    int surpTotal = maxValue * 3 - 2 * maxDiff;
    for (String t : totPoints) {
      int total = Integer.valueOf(t);
      if (total >= maxTotal){
        cnt++;
      }else if(total >= surpTotal && surpCnt > 0){
        cnt++;
        surpCnt--;
      }
    }

    return String.valueOf(cnt);
  }
}
