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 google.code.jam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.ListIterator;

public class DancingWithTheGooglers {

	final static String fileNameIn = "B-large.in";
	final static String fileNameOut = "B-large.out";

	private static int solve(int S, int p, List<Integer> t) {
		int count = 0;
		for (int i = 0; i < t.size(); i++) {
			int bestResultNotSurprising = getBestResultNotSurprising(t.get(i));
			int bestResultSurprising = getBestResultSurprising(t.get(i));
			if (bestResultNotSurprising >= p) {
				count++;
			} else if (bestResultSurprising >= p && S > 0) {
				count++;
				S--;
			}
		}
		return count;
	}

	private static int getBestResultNotSurprising(int n) {
		return getBestResult(n, false);
	}

	private static int getBestResultSurprising(int n) {
		return getBestResult(n, true);
	}

	private static int getBestResult(int n, boolean surprising) {
		int average = (int) Math.floor(n / 3);
		int residue = n % 3;
		if (n == 0)
			return 0;
		if (surprising && residue == 0)
			return average + 1;
		if (surprising && residue == 1)
			return average + 1;
		if (surprising && residue == 2)
			return average + 2;
		if (!surprising && residue == 0)
			return average;
		if (!surprising && residue == 1)
			return average + 1;
		if (!surprising && residue == 2)
			return average + 1;
		return average;
	}

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader(fileNameIn));
		BufferedWriter out = new BufferedWriter(new FileWriter(fileNameOut));
		int testCases = Integer.parseInt(in.readLine());
		for (int i = 0; i < testCases; i++) {
			String[] elements = in.readLine().split(
					new Character((char) 32).toString());
			List<Integer> values = new ArrayList<Integer>();
			for (String v : elements) {
				values.add(Integer.valueOf(v));
			}
			ListIterator<Integer> iterator = values.listIterator();
			int N = iterator.next();
			int S = iterator.next();
			int p = iterator.next();
			List<Integer> t = values.subList(values.size() - N, values.size());
			out.write(String.format("Case #%s: %s\n", i + 1, solve(S, p, t)));
		}
		in.close();
		out.close();
	}

}
