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;

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

public class DancingGooglers {

	private static boolean testing = false;

	private static int surprisingScores;

	private static int getPossibleCount(int score, int findingThreshold) {
		int a;
		int b;
		int c;
		a = b = c = (score / 3);
		int rem = score % 3;
		if (b < findingThreshold - 2) {
			return 0;
		}
		if (b >= findingThreshold) {
			if (testing) {
				System.out.println("SUCCESS1:  score: " + score + ", a: " + a
						+ ", b: " + b + ", c: " + c);
			}
			return 1;
		}
		if (b == findingThreshold - 1) {
			if (rem >= 1) {
				if (testing) {
					System.out.println("SUCCESS2:  score: " + score + ", a: "
							+ a + ", b: " + b + ", c: " + c);
				}
				return 1;
			} else if (surprisingScores > 0 && a > 0) {
				surprisingScores--;
				if (testing) {
					System.out.println("SUCCESS3:  score: " + score + ", a: "
							+ a + ", b: " + b + ", c: " + c);
				}
				return 1;
			}
			return 0;
		}
		if (b == findingThreshold - 2 && rem == 2 && surprisingScores > 0) {
			surprisingScores--;
			if (testing) {
				System.out.println("SUCCESS4:  score: " + score + ", a: " + a
						+ ", b: " + b + ", c: " + c);
			}
			return 1;
		}
		return 0;
	}

	private static int countMaxPossible(Scanner scanner) {
		int count = 0;
		int numOfScores = scanner.nextInt();
		surprisingScores = scanner.nextInt();

		int findingThreshold = scanner.nextInt();
		int[] scores = new int[numOfScores];
		for (int i = 0; i < numOfScores; i++) {
			scores[i] = scanner.nextInt();
			count += getPossibleCount(scores[i], findingThreshold);
		}
		// start printing
		if (testing) {
			System.out.println("numOfScores: " + numOfScores);
			System.out.println("surprisingScores: " + surprisingScores);
			System.out.println("findingThreshold: " + findingThreshold);
			for (int i : scores) {
				System.out.print(i + ", ");
			}
			System.out.println();
		}
		// end printing
		return count;
	}

	public static void main(String[] args) throws FileNotFoundException {
		File file = new File("d:\\codeJam\\Dancing\\test.txt");
		Scanner scanner = new Scanner(file);
		int t = scanner.nextInt();
		int count;
		for (int i = 1; i <= t; i++) {
			count = countMaxPossible(scanner);
			System.out.println("Case #" + i + ": " + count);
		}
	}
}
