import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

package com.google;

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

public class Googlers {
    public static void main(String[] args) throws IOException {
        final Scanner reader = new Scanner(new File("in.txt"));
        final FileWriter writer = new FileWriter(new File("out.txt"));
        
        final int N = reader.nextInt();
        reader.nextLine();
        
        for (int i = 0; i < N; i++) {
            final int n = reader.nextInt();
            final int exceptions = reader.nextInt();
            final int winScore = reader.nextInt();
            
            final int [] participants = new int [n]; 
            for (int j = 0; j < n; j++) {
                participants[j] = reader.nextInt();
            }
            
            writer.write(String.format("Case #%d: %d", (i + 1), howManyCanWin(exceptions, winScore, participants)));
            if (i < N - 1) {
                writer.write("\n");
            }
        }
        
        writer.close();
    }
    
    public static int howManyCanWin(final int exceptions, final int winScore, final int [] participants) {
        int remainException = exceptions;
        int res = 0;
        
        for (int i : participants) {
            final int thirdPart = i / 3;
            final int lastPart = i % 3;

            if ((thirdPart >= winScore) ||
                (lastPart == 1 && thirdPart + 1 >= winScore) ||
                (lastPart == 2 && thirdPart + 1 >= winScore)) {
                res++;
                continue;
            }
            
            if ((lastPart == 0 && thirdPart + 1 >= winScore && thirdPart - 1 >= 0 && remainException > 0) || 
                (lastPart == 2 && thirdPart + 2 >= winScore && remainException > 0)    ){
                remainException --;
                res++;
                continue;
            }
        }
        
        return res;
    }
}
