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 lk.iit.wall.framework.network;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * User: Amila
 * Date: 4/13/12
 * Time: 10:48 PM
 * To change this template use File | Settings | File Templates.
 */
public class CodeJamOne {

    public static void main(String[] args) {
        File file = new File("D:\\small.txt");
        try {
            //
            // Create a new Scanner object which will read the data
            // from the file passed in. To check if there are more
            // line to read from it we check by calling the
            // scanner.hasNextLine() method. We then read line one
            // by one till all line is read.
            //
            Scanner scanner = new Scanner(file);
            int cases = scanner.nextInt();
            for (int i = 0; i < cases; i++) {
                int googlers = scanner.nextInt();
                int supprise = scanner.nextInt();
                int max = scanner.nextInt();
                int numGoog = 0;
                int[] nums = new int[googlers];
                for (int j = 0; j < googlers; j++) {
                    int score = scanner.nextInt();
                    nums[j] = score;
                }
                Arrays.sort(nums);
                for (int j = googlers - 1; j >= 0; j--) {
                    int score = nums[j];
                    double d = score / 3f;
                    int div = (int) Math.ceil(d);
                    int mod = score % 3;
                    if (div >= max) {
                        numGoog++;
                        continue;
                    }
                    /*if (mod == 2) {
                        if (div + 2 >= max && supprise != 0 && score > 1 && score < 29) {
                            numGoog++;
                            supprise--;
                            continue;
                        }
                    } else */if(mod==0 || mod == 2){
                        if (div + 1 >= max && supprise != 0 && score > 1 && score < 29) {
                            numGoog++;
                            supprise--;
                            continue;
                        }
                    }
                }
                System.out.println("Case #" + (i + 1) + ": " + numGoog);

            }
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }
}
