import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
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;
	}
}
