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 year2012.qualification.b;

import java.io.File;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class DancingWithTheGooglers {
	public static void main(String[] args) throws Exception{
		//GCJÃÃÂ±ÃÃÃ¶
		String filename = "src/year2012/qualification/b/B-large";
		PrintWriter out = new PrintWriter(new File(filename + ".out"));
		Scanner scan = new Scanner(new File(filename + ".in"));
		
		final int T = scan.nextInt();
		
		for(int i=0;i<T;i++){
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int[] t = new int[N];
			int ans = 0;
			for(int j=0;j<N;j++){
				t[j] = scan.nextInt();
			}

			//surprisingâÃÃÃÃÃ´ÃÂ£Ãº
			List<Integer> probableSurprising = new ArrayList<Integer>();
			
			//30âÃÂ®29âÃÂ®28âÃÃâ°Ã¦Ã£ÃÂ§Ã±
			for(int j=0;j<N;j++){
				if(t[j] == 30 || t[j] == 29 || t[j] == 28){
					ans++;
				}else if(t[j] == 0){
					if(p==0)
						ans++;
				}else if(t[j] == 1){
					if(p==1)
						ans++;
				}else{
					if((int) Math.ceil((double)t[j] / 3.0) < p){
						probableSurprising.add(t[j]);
					}else{
						ans++;
					}
				}
				
			}
			//âÃÃ¥surprisingâÃÃ£âÃÃâÃÃ³âÃÃ¥âÃâ¢âÃÃÃÃ¯ââÃÃ§âÃÃ­ÃÂ¶Ã£âÃÂ¶âÃÃâÃÃ¨âÃÃ
			Collections.sort(probableSurprising, new Comparator<Integer>(){
			      public int compare(Integer t1, Integer t2) {
			        return t2 - t1;
			      }
			    });
			for(int j=0;j<probableSurprising.size();j++){
				int best=-1;
				//ÃÃºÃÃÃ Ã¹âÃÃSÃÃÃ£âÃÃsurprising
				if(j<S){
					int mod =probableSurprising.get(j) %3;
					if(mod == 1){
						best = (probableSurprising.get(j) + 2) / 3;
					}else if(mod == 2){
						best = (probableSurprising.get(j) + 4) / 3;
					}else if(mod == 0){
						best = (probableSurprising.get(j) + 3) / 3;
					}
				}else{
					//surprisingâÃÃâÃÃâÃâ¢âÃÃÃÃ¯ââÃÃ3âÃÃÃÃ¢â¤âÃÂ£âÃÂ¶ÃÃ Ã¡âÃÃ¤â°âÃ¤âÃÃ­âÃÃ¥âÃâbestâÃÃÃÃÏâÃÃ¥ÃÃ¡â«âÃÃ£
					best =(int) Math.ceil((double)probableSurprising.get(j) / 3.0);	
				}
				if(best >= p){
					ans++;
				}
				
			}
			System.out.println("Case #"+(i+1)+": "+ ans);
			out.printf("Case #%d: %s\n", i+1, ans);
		}
		out.flush();
	}
}
