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;
            }
        }
    }
}
/**
 * 
 * @author slerig
 *
 */

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

public class ScoreChecker {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		File inFile = new File("B-large.in");
		PrintWriter outFile = new PrintWriter("B-large.out");
		Scanner in = new Scanner(inFile);
		
		int cases = in.nextInt();
		for(int i = 1; i <= cases; i++)
		{
			int googlers = in.nextInt();
			int surprising = in.nextInt();
			int minScore = in.nextInt();
			int googlersWithMin = 0;
			int[][] scores = new int[googlers][3];
			
			// Determining individual scores from total scores; before
			// surprising scores are taken into account.
			for(int j = 0; j < googlers; j++)
			{
				float score = in.nextLong();
				float ftemp = score / 3;
				int temp = (int)ftemp;
				if(ftemp - temp > 0.5)
				{
					scores[j][0] = temp + 1;
					scores[j][1] = temp + 1;
					scores[j][2] = temp;
				}
				else if(ftemp - temp > .25)
				{
					scores[j][0] = temp + 1;
					scores[j][1] = temp;
					scores[j][2] = temp;
				}
				else
				{
					for(int k = 0; k < 3; k++)
					{
						scores[j][k] = temp;
					}
				}
			}
			
			// Editing for surprising scores.
			for(int j = 0; j < googlers; j++)
			{
				// Very complicated way of deciding which scores are the surprising scores.
				if(surprising > 0 && scores[j][0] != 0 && scores[j][1] != 0 && scores[j][2] != 0)
					if(scores[j][0] != 10 && (scores[j][0] >= minScore-1 && scores[j][0] < minScore))
						if((scores[j][0] == scores[j][1]))
						{
							scores[j][0]++;
							scores[j][1]--;
							surprising--;
						}
			}
			
			// Checking for googlers with min score.
			for(int j = 0; j < googlers; j++)
			{
				if(scores[j][0] >= minScore)
					googlersWithMin++;
			}
			
			outFile.println("Case #" + i + ": " + googlersWithMin);
			
			/* Debugging code
			outFile.println();
			for(int j = 0; j < googlers; j++)
			{
				for(int k = 0; k < 3; k++)
				{
					outFile.print(scores[j][k] + " ");
				}
				outFile.println();
			}
			*/
		}
		outFile.close();
	}

}
