/**
 * 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.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;


public class GCJ_2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
		
		int T = scan.nextInt();
		scan.nextLine();
		
		int nCase = 1;
		while (T-- > 0) {
			
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			
			PriorityQueue<Integer> queue = new PriorityQueue<Integer>(10, new Comparator<Integer>() {

				@Override
				public int compare(Integer o1, Integer o2) {
					
					return o2.compareTo(o1);
				}
				
			});
			for (int i = 0; i < N; i++) {
				queue.add(scan.nextInt());
			}
			
			int output = 0;
			while (!queue.isEmpty() && S >= 0) {
				Integer i = queue.poll();
				//System.out.println(i);
				int r = i % 3;
				int q = i / 3;
				
				if (r != 0) q++;
				
				//dont need to be surprising
				if (q >= p) {
					output++;
					continue;
				}
				
				if (S == 0) break; //dont need continue processing
				if (q == 0) continue;
				//needs to use surprising
				S--;
				if (r == 0) //everybody is equal
				{
					q++;
				} else if (r == 1)  
				{
					//cant add
				} else {
					q++;
				}
				
				if (q >= p) output++;
				
			}
			
			
			scan.nextLine();
			
			System.out.println("Case #" + (nCase++) + ": " + output);
		}

	}

}
