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.*;


public class B
{
	public static void main(String args[]) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(br.readLine());
		String[] line;
		int N,S,p;
		int[][] tuple = new int[1000][3];
		int[][] stuple = new int[1000][3];
		int count = 0;
		int scount = 0;

		for(int i=10;i>=0;i--)
		{
			for(int j=i-2;j<=i+2;j++)
			{
				if(j<0 || j>10) continue;
				for(int k=i-2;k<=i+2;k++)
				{
					if(k<0 || k>10) continue;
					if(j-k >2 || k-j > 2)
						continue;
					int a = (i-j > 0) ? i-j : j-i;
					int b = (i-k > 0) ? i-k : k-i;
					int c = (k-j > 0) ? k-j : j-k;

					if(a==2 || b==2 || c==2)
					{
						stuple[scount][0] = i;
						stuple[scount][1] = j;
						stuple[scount++][2] = k;
						continue;
					}
					tuple[count][0] = i;
					tuple[count][1] = j;
					tuple[count++][2] = k;
				}
			}
		}
			

		for(int i=1;i<=T;i++)
		{
			line = br.readLine().split("\\W+");
			N = Integer.parseInt(line[0]);
			S = Integer.parseInt(line[1]);
			p = Integer.parseInt(line[2]);
			int[] score = new int[N];

			for(int j=0;j<N;j++)
				score[j] = Integer.parseInt(line[3+j]);

			int ret = 0;
			for(int j=0;j<N;j++)
			{
				boolean found = false;

				for(int k=0;k<count;k++)
				{
					if((tuple[k][0] + tuple[k][1] + tuple[k][2]) == score[j])
					{
						if(tuple[k][0] >= p || tuple[k][1] >= p || tuple[k][2] >= p)
						{
							found = true;
							ret++;
							break;
						}
					}
				}
				if(!found && S!=0)
				{
					for(int k=0;k<scount;k++)
					{
						if((stuple[k][0] + stuple[k][1] + stuple[k][2]) == score[j])
						{
							if(stuple[k][0] >= p || stuple[k][1] >= p || stuple[k][2] >= p)
							{
								found = true;
								S--;
								ret++;
								break;
							}
						}
					}
				}
			}

			System.out.println("Case #"+i+": "+ret);
		}
	}
}
