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


import java.io.BufferedReader;
import java.io.IOException;
import java.io.StringReader;
import java.util.HashSet;
import java.util.Set;


public class Dancing {

	
	public static void main(String [] args) throws NumberFormatException, IOException
	{
		BufferedReader in = new BufferedReader(new StringReader(args[0]));
		int rows = Integer.parseInt(in.readLine());
		for ( int i = 1; i <= rows; i++)
		{
			String line = in.readLine();
			String[] vals = line.split(" ");
			int googlers = Integer.parseInt(vals[0]);
			int surprising = Integer.parseInt(vals[1]);
			int score = Integer.parseInt(vals[2]);
			int [] googlerScores = new int[googlers];
			
			for ( int j = 0; j < googlerScores.length; j++)
			{
				googlerScores[j]=Integer.parseInt(vals[3+j]);
			}
			
			//System.out.println("Surprising: " + surprising);
			int maxCount = 0;
			
			int normalCount = 0;
			int suprisingCount = 0;
			Set<Integer> normals = new HashSet<Integer>();
			for ( int k = 0; k < googlers; k++ )
			{
				if ( getBestRegularScore(googlerScores[k])>=score )
				{
					normalCount++;
					normals.add(k);
				}				
			}
			
			for ( int k = 0; k < googlers; k++ )
			{
				if ( !normals.contains(k) 
						&& getBestSurprisingScore(googlerScores[k])>=score )
				{
					suprisingCount++;
				}				
				if ( suprisingCount == surprising )
				{
					break;
				}
			}
			
//			for ( int j = 0; j < Math.pow(2, googlers); j++)
//			{
//				if ( instanceCount(j) == surprising )
//				{
//					//System.out.println("Case: " + Integer.toBinaryString(j));
//					int count = 0;
//					for ( int k = 0; k < googlers; k++ )
//					{
//						int pow = (int) Math.pow(2,k);
//						boolean normal = (pow & j) == 0;
//						//System.out.println(k+": "+ normal);
//						if ( normal && getBestRegularScore(googlerScores[k])>=score )
//						{
//							count++;
//						}
//						else if ( !normal && getBestSurprisingScore(googlerScores[k])>=score )
//						{
//							count++;
//						}
//					}
//					if ( count >= maxCount )
//					{
//						maxCount = count;
//					}
//					
//				}
//			}
			
			System.out.println("Case #"+i+": " + (normalCount+suprisingCount));
		}
	}
	
	public static int instanceCount(int number)
	{
		int count = 0;
		for ( char c : Integer.toString(number, 2).toCharArray() )
		{
			if ( c == '1' )
			{
				count++;
			}
		}
		return count;
	}
	
	public static int getBestRegularScore(int totalScore)
	{
		int bestScore = totalScore/3;
		if ( totalScore%3>0)
		{
			bestScore++;
		}
		return bestScore>10?10:bestScore;
	}
	
	public static int getBestSurprisingScore(int totalScore)
	{
		if ( totalScore == 0 )
		{
			return 0;
		}
		int ret = (totalScore+4)/3; 
		return ret>10?10:ret;
	}
}
