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;
            }
        }
    }
}
public class DataModel extends Thread {
		
		private int googlersNo;
		private int suprScore;
		private int minScore;
		private int[] googScore;
		private int caseNo;
		private int output;
		private boolean stateCalc;
		
		public DataModel(String input, int caseNo) {
			this.caseNo = caseNo;
			String[] temp = input.split(" ");
			stateCalc = false;
			try {
				googlersNo = Integer.parseInt(temp[0]);
				suprScore = Integer.parseInt(temp[1]);
				minScore = Integer.parseInt(temp[2]);
				googScore = new int[googlersNo];
				for(int i = 0;i<googlersNo;i++) {
					googScore[i] = Integer.parseInt(temp[3+i]);
				}
			} catch (Exception e) {
				e.printStackTrace();
				System.exit(1);
			}
		}
		
		private boolean isOverReqScore(int i) {
			int[] temp = {i/3,i/3,i/3};
			int diff = (i-(temp[0]+temp[1]+temp[2]));
			int minDiff = minScore-temp[0];
			if(diff > 0) {
				temp[0] += 1;
				if(diff > 1 && minDiff < 3 && minDiff > 0 && suprScore > 0) {
					temp[0] += 1;
					suprScore--;
				} else if(diff > 1) {
					temp[1] += 1;
				} 
			} else if (minDiff == 1 && temp[0]!=0 && suprScore > 0) {
				temp[0] += 1;
				temp[2] -= 1;
				suprScore--;
			}
			return (temp[0]>=minScore||temp[1]>=minScore||temp[2]>=minScore);
		}
		
		@Override
		public void run() {
			for(int i = 0;i<googlersNo;i++) {
				if(isOverReqScore(googScore[i])) {
					output++;
				}
			}
			stateCalc = true;
		}
		
		public boolean isDone() { 
			return stateCalc;
		}
		
		public void getOutput() {
			System.out.println("Case #"+caseNo+": "+output);
		}
	}