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

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Codejam_2 {
	
	static byte cases;
	static int[] googlers = new int[100];
	static int[] supr_triplets = new int[100];
	static int[][] total_scores = new int[100][100];
	static int[][] max = new int[100][100];
	static int[][] supr_max = new int[100][100];
	static int[] treshold = new int[100];
	static int[] result = new int[100];
	
	public static void read_input() {
		
		Scanner s = null;
		try {
			s = new Scanner(new FileReader("./src/ulohy/B-small-attempt0.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		cases = s.nextByte();		
		
		for (int i = 0; i < cases; i++) {
			googlers[i] = s.nextInt();
			supr_triplets[i] = s.nextInt();
			treshold[i] = s.nextInt();
			for (int j = 0; j < googlers[i]; j++) {
				total_scores[i][j] = s.nextInt();				
			}			
		}

		s.close();	
	}
	
	public static void write_output() {
		FileWriter outFile;
		try {
			outFile = new FileWriter("./src/ulohy/output");		
			PrintWriter out = new PrintWriter(outFile);
			for (int i = 1; i <= cases; i++) {
				out.println("Case #"+i+": "+result[i-1]);				
			}
			out.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}	
	
	public static void main(String args[]) {
		
		read_input();
		
		for (int i = 0; i < cases; i++) {			
			for (int j = 0; j < googlers[i]; j++) {
				if (total_scores[i][j] > 0) {
					switch (total_scores[i][j] % 3) {
					case 0:
						max[i][j] = total_scores[i][j]/3;
						supr_max[i][j] = total_scores[i][j]/3 + 1;
						break;
					case 1:
						max[i][j] = total_scores[i][j]/3 + 1;
						supr_max[i][j] = total_scores[i][j]/3 + 1;
						break;
					case 2:
						max[i][j] = total_scores[i][j]/3 + 1;
						supr_max[i][j] = total_scores[i][j]/3 + 2;
						break;
					default:
						break;
					}
				}
			}
			
			for (int j = 0; j < googlers[i]; j++) {
				if (max[i][j] >= treshold[i]) {
					result[i]++;
				} else {
					if (supr_max[i][j] >= treshold[i] && supr_triplets[i] > 0) {
						result[i]++;
						supr_triplets[i]--;
					}
				}
			}
		}
		
		write_output();
		
	}

}
