/**
 * 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.util.*;
import java.io.*;

public class DancingWithGooglers {
	public void translate() throws Exception {
		Scanner sc = new Scanner(new FileReader("C:\\Users\\i047312\\Desktop\\B-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C:\\Users\\i047312\\Desktop\\output_small_B.txt"));
		//Translator
		int t = sc.nextInt();
		for (int i = 0; i < t; i++) {
			pw.print("Case #" + (i + 1) + ": ");
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[][] l = new int[n][3];
			for (int j = 0; j < n; j++) {
				int score = sc.nextInt();
				int q = score / 3;
				int r = score % 3;
				if (r == 1) {
					l[j][0] = q;
					l[j][1] = q;
					l[j][2] = q + 1;
				} else if (r == 2) {
					l[j][2] = q;
					l[j][0] = q + 1;
					l[j][1] = q + 1;
				} else {
					l[j][0] = q;
					l[j][1] = q;
					l[j][2] = q;
				}
			}
			int s1 = 0;
			int count = 0;
			for (int j = 0; j < l.length; j++) {
				if (l[j][0] >= p || l[j][1] >= p || l[j][2] >= p) {
					count++;
					continue;
				} else if (s1 < s && p > 1) {
					if ((l[j][0] == p-1 && l[j][1] == p-1) || (l[j][2] == p-1 && l[j][1] == p-1) || (l[j][0] == p-1 && l[j][2] == p-1)) {
						count++;
						s1++;
						continue;
					}
				}
			}
			pw.println(count);
		}
		
		pw.flush();
		pw.close();
		sc.close();
	}
	
	public static void main(String[] args) throws Exception {
		new DancingWithGooglers().translate();
	}
}
