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;
            }
        }
    }
}
/*
 * Patrick Bonnell
 * Google Code Jam 2012
 * Qualification Round
 * Dancing With the Googlers
 */


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


public class DancingSolution
{
	String filename;
	Case[] cases;
	
	private class Case
	{
		int s, p;
		int totals[];
		
		public Case(int n, int s, int p)
		{
			totals = new int[n];
			this.s = s;
			this.p = p;
		}
		
		public boolean hasBestResult(int i, boolean canBeSurprising)
		{
			int currentBest = 10;
			int remainder, min, max;
			
			while(currentBest >= p)
			{
				remainder = totals[i] - currentBest;
				
				if(canBeSurprising)
				{
					if((currentBest - 2) > -1) min = currentBest - 2;
					else min = currentBest;
					
					if((currentBest + 2) < 11) max = currentBest + 2;
					else max = currentBest;
				}
				else
				{
					if((currentBest - 1) > -1) min = currentBest - 1;
					else min = currentBest;
					
					if((currentBest + 1) < 11) max = currentBest + 1;
					else max = currentBest;
				}
				
				if(remainder >= (min * 2) && remainder <= (max * 2)) return true;
				
				currentBest--;
			}
			
			return false;
		}
	}
	
	public DancingSolution(String filename) throws FileNotFoundException
	{
		this.filename = filename;
		Scanner sc = new Scanner(new File(filename));
		
		cases = new Case[sc.nextInt()];
		
		for(int i=0; i<cases.length; i++)
		{
			cases[i] = new Case(sc.nextInt(), sc.nextInt(), sc.nextInt());
			
			for(int j=0; j<cases[i].totals.length; j++)
				cases[i].totals[j] = sc.nextInt();
		}
	}
	
	public void solve() throws IOException
	{
		BufferedWriter out = new BufferedWriter(new FileWriter(new File(filename.replace("in", "out"))));
		for(int i=0; i<cases.length; i++)
			out.write("Case #"+(i+1)+": "+solveCase(i)+"\n");
		out.close();
	}
	
	private int solveCase(int n)
	{
		int withBestResult = 0;
		int suprisingResults = 0;
		
		for(int i=0; i<cases[n].totals.length; i++)
		{
			if(cases[n].hasBestResult(i, false))
				withBestResult++;
			else if(suprisingResults < cases[n].s && cases[n].hasBestResult(i, true))
			{
				withBestResult++;
				suprisingResults++;
			}
		}
		
		return withBestResult;
	}
	
	public static void main(String[] args)
	{
		System.out.print("Input file: ");
		try
		{
			DancingSolution sol = new DancingSolution(new Scanner(System.in).nextLine());
			System.out.println("Running...");
			sol.solve();
			System.out.println("Done.");
		}
		catch(IOException e)
		{
			System.err.println(e);
		}
	}
}
