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 dancingWithGooglers;


public class BestResult 
{
	public int result(String input)throws Exception
	{
		String[] array= input.split(" ");
		int noOfGooglers = Integer.parseInt(array[0]);
		int surprising = Integer.parseInt(array[1]);
		int p = Integer.parseInt(array[2]);
		int x;
		int[] listOfBestResults = new int[noOfGooglers];
		int count = 0;
		for(int i=3;i<array.length;i++)
		{
			x = Integer.parseInt(array[i]);
			if(canItBeBestResult(x, p))
			{
				listOfBestResults[count] = x;
				count++;
			}
		}
		int bestResultCount = 0;
		for(int i=0;i<count;i++)
		{
			if(listOfBestResults[i]%3 == 2)
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				
				else if((listOfBestResults[i]/3) + 2>=p && (listOfBestResults[i]/3) + 1>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 2>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			else if(listOfBestResults[i]%3 == 1 )
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 1>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				else if((listOfBestResults[i]/3) + 1>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			else if( listOfBestResults[i]%3 == 0 )
			{
				if(listOfBestResults[i]/3>=p)
				{
					System.out.println("list of best result w/o surprising " + listOfBestResults[i]);
					bestResultCount++;
				}
				
				else if((listOfBestResults[i]/3) + 1>=p && surprising!=0)
				{
					System.out.println("list of best result surprising " + listOfBestResults[i]);
					bestResultCount++;
					surprising--;
				}
			}
			
		}
		return bestResultCount;
		
	}
	public boolean canItBeBestResult(int x, int p)
	{
		if(p==0)
		{
			return true;
		}
		if( x%3 == 2 && ((x/3)+2) >= p)
		{
			return true;
		}
		else if( x%3 == 1 && ((x/3)+1) >= p)
		{
			return true;
		}
		else if( x%3 == 0 && ((x/3)+1)>=p && x!=0)
		{
			return true;
		}
		
		return false;
	}
}
