import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


package com.self.code.jam.twelve;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.Reader;

public class DancingScores {

	public static void main(String[] argv)
	{
		try
		{
			long startTime = System.currentTimeMillis();
			Reader reader = new FileReader("D:\\workspace\\Learn\\src\\com\\self\\code\\jam\\twelve\\input\\dancing\\B-large.in");
			BufferedReader bufReader = new BufferedReader(reader);
			String x = bufReader.readLine();
			int count = 0;

			File file = new File("D:\\workspace\\Learn\\src\\com\\self\\code\\jam\\twelve\\output\\dancing\\B-large.out");
			FileWriter writer = new FileWriter(file);
			
			while((x = bufReader.readLine()) != null)
			{
				count++;
				String res = DancingScores.getMaxBestResult(x);
				if (count == 1)
					writer.write("Case #"+count+": " + res);
				else
					writer.write("\nCase #"+count+": " + res);
			}
			writer.close();
			System.out.println("Total time = " +( System.currentTimeMillis() - startTime));
		}
		catch (Exception e) {
			e.printStackTrace();
		}
	}

	private static String getMaxBestResult(String input) {
		String[] numbers = input.split(" ");
		if(numbers.length <= 3)
			return "0";
		int N = Integer.parseInt(numbers[0]);
		int S = Integer.parseInt(numbers[1]);
		int P = Integer.parseInt(numbers[2]);

		int maxBestResult = 0;
		
		for (int i=3; i<(3+N); i++)
		{
			int number = Integer.parseInt(numbers[i]);
			int division = number/3 ;
			int remainder = number % 3;
			
			if (remainder == 0)
			{
				if (division >= P)
				{
					maxBestResult ++;
				}
				else if ((S != 0) && ((division + 1) >= P) && (division !=0))
				{
					S--;
					maxBestResult ++;
				}
			}
			else if (remainder == 1)
			{
				if ((division + 1) >= P)
				{
					maxBestResult ++;
				}
				// it can not be a Surprising case
			}
			else if (remainder == 2)
			{
				if ((division + 1) >= P)
				{
					maxBestResult ++;
				}
				else if ((S != 0) && ((division + 2) >= P))
				{
					S--;
					maxBestResult ++;
				}
			}
		}
		return String.valueOf(maxBestResult);
	}
}
