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.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class DancingWithTheGooglers {
	public static void main(String[] args){
		Scanner keyin=new Scanner(System.in);
		int T=keyin.nextInt();
		int caseCount=0;
		while ((T--)>0){
			int N=keyin.nextInt();
			int S=keyin.nextInt();
			int P=keyin.nextInt();
			int[] googler=new int[N];
			for (int i=0; i<N; i++){
				googler[i]=keyin.nextInt();
			}
			caseCount++;
			ArrayList<int[][]> googlerScore=new ArrayList<int[][]>();
			
			for (int index=0; index<googler.length; index++){
				int remainder=googler[index];
				int[] arrayInit=new int[3];
				for (int i=3; i>0; i--){
					int temp=remainder/i;
					remainder-=temp;
					arrayInit[3-i]=temp;
				}
				int[][] arrayScore=new int[2][3];
				arrayScore[0]=arrayInit;
				if (arrayInit[0]==arrayInit[1] && arrayInit[1]==arrayInit[2]){
					int[] temp={arrayInit[0]-1,arrayInit[1],arrayInit[2]+1};
					arrayScore[1]=temp;
				}
				else if (arrayInit[0]==arrayInit[1] && arrayInit[1]!=arrayInit[2]){
					int[] temp={arrayInit[0]-1,arrayInit[1]+1,arrayInit[2]};
					arrayScore[1]=temp;
				}
				else if (arrayInit[0]!=arrayInit[1] && arrayInit[1]==arrayInit[2]){
					int[] temp={arrayInit[0],arrayInit[1]-1,arrayInit[2]+1};
					arrayScore[1]=temp;
				}
				//System.out.println(Arrays.deepToString(arrayScore));
				googlerScore.add(arrayScore);
			}
			
			int result=N;
			for (int index=0; index<googlerScore.size(); index++){
				if (googlerScore.get(index)[0][2]<P){
					if (googlerScore.get(index)[1][2]<P){
						result--;
					}
					else {
						if (S>0 && googlerScore.get(index)[1][0]<0){
							S--;
							result--;
							//System.out.println("S R "+S+" "+result);
						}
						else if (S>0){
							S--;
							//System.out.println("S "+S);
						}
						else if (S<=0) {
							result--;
							//System.out.println("R "+result);
						}
					}
				}
			}
			System.out.println("Case #"+caseCount+": "+result);
		}
	}
}
