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

}

import java.io.*;

public class G2 {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new FileReader("d:\\B-small-attempt0.in"));
        int n = Integer.parseInt(in.readLine());
        int cnt;
        int surprize;
        int min;
        int[] points;
        BufferedWriter out = new BufferedWriter(new FileWriter("d:\\g2o.txt"));
        for (int i = 1; i <= n; i++) {
            String[] s = in.readLine().split(" ");
            cnt = Integer.parseInt(s[0]);
            surprize = Integer.parseInt(s[1]);
            min = Integer.parseInt(s[2]);
            points = new int[cnt];
            for (int j = 0; j < cnt; j++) {
                points[j] = Integer.parseInt(s[3 + j]);
            }
            int answer = solve(cnt, surprize, min, points);
            System.err.println("Case #" + i + ": " + answer);
            out.write("Case #" + i + ": " + answer);
            out.newLine();
        }
        out.close();
    }

    private static int solve(int cnt, int surprize, int min, int[] points) {
        int anywayTotal = 0;
        int surprizingTotal = 0;
        
        int anywayMax = 0;
        int surprizingMax = 0;

        for (int point : points) {
            int whole = (point) / 3;
            int part = point % 3;
            if (point > 0 && part == 0) {
                whole--;
                part = 3;
            }
            anywayMax = surprizingMax = whole;    
            
            switch (part) {
                case 1:
                    anywayMax++;
                    break;
                case 2:
                case 3:
                    anywayMax++;
                    surprizingMax+=2;
                    break;
            }
            if (anywayMax >= min)
                anywayTotal++;
            else if (surprizingMax >= min)
                surprizingTotal++;

        }
        return anywayTotal + Math.min(surprize, surprizingTotal);
    }
}
