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;
            }
        }
    }
}
package source;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class DancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException{
		Scanner scan = new Scanner(new File("B-large.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("B-large.out"));
		
		int testCases = scan.nextInt();
		Map<Double, Integer> mapa = new HashMap<Double, Integer>();
		mapa.put(3d,2);
		mapa.put(6d,3);
		mapa.put(9d,4);
		mapa.put(12d,5);
		mapa.put(15d,6);
		mapa.put(18d,7);
		mapa.put(21d,8);
		mapa.put(24d,9);
		mapa.put(27d,10);
		
		for(int i=0; i < testCases; i++){
			int googlers = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			int bestResults = 0;
			
			for(int j=0; j < googlers; j++){
				double qual = scan.nextInt();
				
				double firstSecond = Math.round(qual/3d);
				double third = qual-(firstSecond*2);
				
				if(firstSecond >= p || third >= p) {
					bestResults++;
				} else if(s > 0 && p-third <= 2 && third <= firstSecond && !(((third+2)-(firstSecond-1)) > 2) && (third+2) <= 10) {
					bestResults++;
					s--;
				} else if(third == firstSecond && mapa.get(qual) != null && mapa.get(qual) >= p && s > 0){
					bestResults++;
					s--;
				} 
			}
			
			bw.write("Case #"+(i+1)+": "+bestResults+"\n");
		}
		bw.flush();
		bw.close();
	}

}
