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

import java.util.ArrayList;

import Controller.IO;

public class AllYourBaseCase extends CaseSolver {

	private String originalLine;
	private StringBuilder currentLine;
	private long numOfSeconds;

	public AllYourBaseCase(int order, int numberOfLines, IO io) {
		super(order, numberOfLines, io);
	}

	@Override
	public void addLine(String line) {
		this.originalLine = line;
		this.currentLine = new StringBuilder(line);
	}

	@Override
	public void initializeVars() {

	}

	@Override
	public void printSolution() {
		System.err.println("Case #" + getOrder() + ": " + numOfSeconds);
	}

	@Override
	public CaseSolver process() {
		ArrayList<Character> chars = getDifDigits();
		int base = chars.size() > 1 ? chars.size() : 2;
		replaceDigits(chars, base);
		numOfSeconds = getNumberInBase10(base);
		return this;
	}

	private long getNumberInBase10(int originalBase) {
		long num = 0, lenght = currentLine.length();
		for (int i = 0; i < lenght; i++) {
			num += getIntByChar(currentLine.charAt(i))
					* Math.pow(originalBase, lenght - (i + 1));
		}
		return num;
	}

	private int getIntByChar(char charAt) {
		if (charAt <= 58) {
			return charAt - 48;
		}
		return charAt - 96 + 9;
	}

	private void replaceDigits(ArrayList<Character> chars, int base) {
		replace(chars.remove(0), getNumberChar(1));
		if (chars.size() == 0) {
			return;
		}
		replace(chars.remove(0), getNumberChar(0));

		int tmp = 2;
		for (char aaa : chars) {
			replace(aaa, getNumberChar(tmp));
			tmp++;
		}
	}

	private String replace(char a, char b) {
		String temp = null;
		int index = -1;
		do {
			index = originalLine.indexOf(a, index + 1);
			if (index > -1) {
				currentLine.setCharAt(index, b);
			}
		} while (index > -1);

		return temp;
	}

	private char getNumberChar(int number) {
		if (number < 10) {
			return (char) (number + 48);
		}
		return (char) (97 + number - 10);
	}

	private ArrayList<Character> getDifDigits() {
		ArrayList<Character> tmp = new ArrayList<Character>();
		char tempChar;
		for (int i = 0; i < originalLine.length(); i++) {
			tempChar = originalLine.charAt(i);
			if (!tmp.contains(tempChar)) {
				tmp.add(originalLine.charAt(i));
			}
		}
		return tmp;
	}

}
