/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;


public class BQ {
	public static void main(String[] args) {
		BufferedReader reader = null;
		BufferedWriter writer = null;
		int T = 0, k, j, N, S, p, i, ti, tis, mod, G = 0;
		String line = null, caseSolution;
		try {
			reader = new BufferedReader(new InputStreamReader(new FileInputStream(args[0])));
			writer = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(args[1])));	
			T = Integer.parseInt(reader.readLine());
			for (k = 1; k <= T; k++) {
				line = reader.readLine();
				N = Integer.parseInt(line.substring(0, j = line.indexOf((int)' ', 0)));
				S = Integer.parseInt(line.substring(++j, j = line.indexOf((int)' ', j)));
				p = Integer.parseInt(line.substring(++j, j = line.indexOf((int)' ', j)));
				for (i = 0; i < N; i++) {
					if (i != N - 1) {
						ti = Integer.parseInt(line.substring(++j, j = line.indexOf((int)' ', j)));
					}
					else {
						ti = Integer.parseInt(line.substring(++j));
					}
					tis = ti/3;
					mod = ti%3;
					if (tis >= p || (tis + 1 >= p && mod > 0)) {
						G++;
					}
					else {
						if (((tis + 1 >= p && mod == 0 && tis > 0) || (tis + 2 >= p && mod == 2)) && S > 0) {
							G++;
							S--;
						}
					}
				}
				writer.write("Case #" + k + ": " + G + "\n");
				G = 0;			
			}
		}
		catch (IOException ex) {
			ex.printStackTrace();
		}
		try {
			if (reader != null) {
				reader.close();
			}
			if (writer != null) {
				writer.close();
			}
		}
		catch (IOException ex) {
			ex.printStackTrace();
		}
	}
}