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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;

public class B {
	public static void main(String[] args) throws IOException{
		BufferedReader in = new BufferedReader(new FileReader(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-large.in")));
		FileWriter out = new FileWriter(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-large.out"));
		//BufferedReader in = new BufferedReader(new FileReader(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-small.in")));
		//FileWriter out = new FileWriter(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-small.out"));
		
		int N = new Integer(in.readLine());
		
		for(int c = 1; c <= N; c++){
			int resp = 0;
			String[] sin = in.readLine().split(" ");
			int n = Integer.parseInt(sin[0]);
			int s = Integer.parseInt(sin[1]);
			int p = Integer.parseInt(sin[2]);
			int[] t = new int[n];
			int[] m = new int[n];
			for(int c1 = 3; c1 <= sin.length-1; c1++){
				t[c1-3] = Integer.parseInt(sin[c1]);
			}
			Arrays.sort(t);
			for(int c1 = 3; c1 <= sin.length-1; c1++){
				int ti = t[c1-3];
				m[c1-3] = 0;
				if(ti != 0){
					if(s > 0){
						int a1 = ti/3;
						int a2 = 0;
						if(a1 + 2 <= 10){
							a2 = a1 + 2;
						}else{
							a2 = 10;
							a1 = 8;
						}
						if((a1+a2+a1 == ti)||
								(a1+a2+a2 == ti)||
								(a1+a2+a2-1 == ti)){
							m[c1-3] = a2;
							if(a2 < p){
								m[c1-3] = 0;
							}else{
								s -= 1;
							}
						}
						if(m[c1-3] == 0){
							a1 -= 1;
							a2 = a1 + 2;
							if((a1+a2+a1 == ti)||
									(a1+a2+a2 == ti)||
									(a1+a2+a2-1 == ti)){
								m[c1-3] = a2;
								if(a2 < p){
									m[c1-3] = 0;
								}else{
									s -= 1;
								}
							}
						}
					}
					if(m[c1-3] == 0){
						int a1 = ti/3;
						if(ti%3 == 0){
							m[c1-3] = a1;
						}
						else{
							m[c1-3] = a1+1;
						}
					}
				}
				if(m[c1-3] >= p){
					resp += 1;
				}
			}
			out.write("Case #" + c + ": " + resp + "\n");
		}
		out.flush();
		out.close();
	}
	static void inverter(int[] b){
		int left = 0;
	    int right = b.length-1;
	  
	    while (left < right) {
	      int temp = b[left]; 
	      b[left]  = b[right]; 
	      b[right] = temp;
	     
	      left++;
	      right--;
	    }
	}
}
