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 MyAllgoritmicLib;

public class Hungary {

	int INF = 1000*1000*1000;

	int n;
	int[][] a;
	int[] xy, yx;
	boolean[] vx, vy;
	int[] minrow, mincol;

	public Hungary(int[][] a) {
		// TODO Auto-generated constructor stub
		this.a = a.clone();
	}
	
	private boolean dotry (int i) {
		if (vx[i])  return false;
		vx[i] = true;
		for (int j=0; j<n; ++j)
			if (a[i][j]-minrow[i]-mincol[j] == 0)
				vy[j] = true;
		for (int j=0; j<n; ++j)
			if (a[i][j]-minrow[i]-mincol[j] == 0 && yx[j] == -1) {
				xy[i] = j;
				yx[j] = i;
				return true;
			}
		for (int j=0; j<n; ++j)
			if (a[i][j]-minrow[i]-mincol[j] == 0 && dotry (yx[j])) {
				xy[i] = j;
				yx[j] = i;
				return true;
			}
		return false;
	}
	
	@SuppressWarnings("unused")
	private int hungary(int num) {
		mincol = new int[num];
		minrow = new int[num];
		xy = new int[num];
		yx = new int[num];
		vx = new boolean[num];
		vy = new boolean[num];

        n = num;
        for (int q = 0; q<n; q++) {
        	mincol[q] = INF;
        	minrow[q] = INF;
        }

		for (int i=0; i<n; ++i)
			for (int j=0; j<n; ++j)
				minrow[i] = Math.min(minrow[i], a[i][j]);
		for (int j=0; j<n; ++j)
			for (int i=0; i<n; ++i)
				mincol[j] = Math.min (mincol[j], a[i][j] - minrow[i]);

        for (int q = 0; q<n; q++) {
        	xy[q] = -1;
        	yx[q] = -1;
        }

		for (int c=0; c<n; ) {
	        for (int q = 0; q<n; q++) {
	        	vx[q] = false;
	        	vy[q] = false;
	        }
			int k = 0;
			for (int i=0; i<n; ++i)
				if (xy[i] == -1 && dotry (i))
					++k;
			c += k;
			if (k == 0) {
				int z = INF;
				for (int i=0; i<n; ++i)
					if (vx[i])
						for (int j=0; j<n; ++j)
							if (!vy[j])
								z = Math.min (z, a[i][j]-minrow[i]-mincol[j]);
				for (int i=0; i<n; ++i) {
					if (vx[i]) minrow[i] += z;
					if (vy[i]) mincol[i] -= z;
				}
			}
		}

		int ans = 0;
		for (int i=0; i<n; ++i)
			ans += a[i][xy[i]];
		return ans;
	}
}
