/**
 * 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.Scanner;


public class DWtG {

	static int T,N,S,P;
	static int[] t = new int[1000];
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = Integer.parseInt(sc.nextLine());
		for (int k = 0; k<T; k++)
		{
			int result = 0;
			N = sc.nextInt();
			S = sc.nextInt();
			P = sc.nextInt();
			for (int i =0; i<N; i++)
			{
				t[i] = sc.nextInt();
				int base =(int) t[i]/3;
				switch (t[i]%3)
				{
				case 0:
				{
					if (base >= P) result++;
					else
					{
						if (S > 0 && base > 0 && base+1>=P)
						{
							result++;
							S--;
						}
					}
					break;
				}
				case 1:
				{
					if (base >= P || base+1 >= P) result++;
					else
					{
						if (S > 0 && base+1 >=P) 
						{
							result ++;
							S--;
						}
					}
					break;
				}
				case 2:
				{
					if (base + 1 >= P || base >= P) result ++;
			          else
			          {
			            if (S > 0 && base + 2 >= P)
			            {
			              result++;
			              S--;
			            }
			          }

					break;
				}
				}
			}
			System.out.println("Case #" + (k+1) + ": " + result);
		}
	}

}
