import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

package com.dagova.dancingWithTheGooglers;

public class DancingWithTheGooglersSolver
{
	private int solution;
	private int bestScore;
	private int surprisedTriplets;
	private int numberOfGooglers;
	
	
	public DancingWithTheGooglersSolver()
	{
		solution = 0;
	}
	
	
	private void checkTotalPoints(int googlerTotalPoints)
	{
		float quotient = googlerTotalPoints / 3f;
		
		if(quotient >= bestScore)
			solution++;
		else
		{
			googlerTotalPoints -= bestScore;
			if(googlerTotalPoints >= 0)
			{
				quotient = googlerTotalPoints / 2f;
				if(quotient + 1 >= bestScore)
					solution++;
				else
				{
					if(surprisedTriplets > 0 && quotient + 2 >= bestScore)
					{
						surprisedTriplets--;
						solution++;
					}
				}
			}
		}
	}
	
	
	public int solve(String line)
	{
		String[] splittedLine = line.split(" ");
		numberOfGooglers = Integer.parseInt(splittedLine[0]);
		surprisedTriplets = Integer.parseInt(splittedLine[1]);
		bestScore = Integer.parseInt(splittedLine[2]);
		
		for(int googler = 0; googler < numberOfGooglers; googler++)
		{
			checkTotalPoints(Integer.parseInt(splittedLine[3+googler]));
		}
		
		return solution;
	}
}
