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

import java.io.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;

public class _Q_B_small {
	public static void main(String[] args) throws Exception {
		String input_file = "B-large.in";
		String output_file = "_Q_B_large_out.txt";
		
		BufferedReader in = new BufferedReader(new FileReader(input_file));
		PrintStream out = new PrintStream(new FileOutputStream(output_file));
		
		in.readLine();
		String line;
		int case_num = 1;
		while ((line=in.readLine()) != null) {  
			String[] line_str = line.split(" ");
			int n = Integer.parseInt(line_str[0]);
			int s = Integer.parseInt(line_str[1]);
			int p = Integer.parseInt(line_str[2]);
			int[] t = new int[n];
			for (int i = 0; i < n; ++i)
				t[i] = Integer.parseInt(line_str[i+3]);
			
			int[] base = new int[n];
			int[] remain = new int[n];
			
			for (int i = 0; i < n; ++i) {
				base[i] = t[i]/3;
				remain[i] = t[i]%3;
			}
			
			// Filter by p
			ArrayList<Integer> valid_index = new ArrayList<Integer>();
			for (int i = 0; i < n; ++i) {
				if (base[i] >= p - 1 ||	base[i] + remain[i] >= p)
					valid_index.add(i);
			}
			
			int s_consumed = 0;
			int result = 0;
			for (Integer i : valid_index) {				
				if (remain[i] == 0) {
					if (base[i] < p) {
						if (base[i] > 0 && s_consumed < s) {
							++s_consumed;
							++result;	
						}
					} else {
						++result;
					}
				}
			}
			
			for (Integer i : valid_index) {				
				if (remain[i] == 1) {
					++result;
				} else if (remain[i] == 2){
					if (base[i] < p - 1) {
						if (s_consumed < s) {
							++s_consumed;
							++result;
						}
					} else {				
						++result;
					}
				}
			}
			
			out.println("Case #" + case_num + ": " + result);
			++case_num;
		}
	}
}
