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 com.google.codejam.p2;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Problem2 {

	private ArrayList<TestCase> cases = new ArrayList<TestCase>();
	
	public void loadInput() {
		try{
			FileInputStream fstream = new FileInputStream("input2.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine = br.readLine(); //read number of lines
			while ((strLine = br.readLine()) != null) {
				String[] info = strLine.split(" ");
				int N = Integer.parseInt(info[0]);
				int S = Integer.parseInt(info[1]);
				int p = Integer.parseInt(info[2]);
				ArrayList<Integer> scores = new ArrayList<Integer>();
				for (int i=1; i<=N; i++)
					scores.add(Integer.parseInt(info[2+i]));
				cases.add(new TestCase(N, S, p, scores));
			}
			in.close();
		}
		catch (Exception e) { }
	}
	
	public static boolean isAtLeastP(int score, int p, boolean usingSurprisingTriplet) {
		int minus1 = (p-1<0?0:p-1);
		int minus2 = (p-2<0?0:p-2);
		if (score >= p+minus1+minus1)
			return true;
		if (usingSurprisingTriplet) {
			if (score >= p+minus2+minus2)
				return true;	
		}
		return false;
	}
	
	public void getOutput() {
		for (int i=0; i<cases.size(); i++) {
			TestCase tc = cases.get(i);
			int total = 0;
			for (int score : tc.scores) {
				if (isAtLeastP(score, tc.p, false))
					total++;
				else if (tc.S > 0) {
					if (isAtLeastP(score, tc.p, true)) {
						total++;
						tc.S--;
					}
				}
			}
			System.out.println("Case #" + (i+1) + ": " + total);
		}
	}
	
	
	public static void main(String args[]) {
		Problem2 p = new Problem2();
		p.loadInput();
		p.getOutput();
	}
	
}
