import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

package codejam2012.qr.dancing;

import java.util.concurrent.atomic.AtomicInteger;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author fedez
 */
public class DancerSolver
{

    private static Logger logger = Logger.getLogger(DancerSolver.class.getName());

    public static int solve(int googlers, int[] scores, int suprises, int scoreTopass)
    {
        AtomicInteger surprisesLeft;
        int numberOfPasses = 0;
        int score, i, possible;

        surprisesLeft = new AtomicInteger(suprises);
        for (i = 0; i < googlers; i++)
        {
            score = scores[i];
            possible = isItPossible(score, surprisesLeft, scoreTopass);
            logger.log(Level.INFO, "Score:{0}, surprisesLeft:{1}, scoreTopass:{2}, result:{3}", new Object[]
                    {
                        score, surprisesLeft, scoreTopass, possible
                    });

            numberOfPasses += possible;
        }

        return numberOfPasses;
    }

    private static int isItPossible(double score, AtomicInteger surprisesLeft, int scoreTopass)
    {
        double remainder, leftValues, lowestValue;

        if (scoreTopass == 0)
        {
            return 1;
        }

        remainder = score - scoreTopass;
        if (remainder < 0)
        {
            return 0;
        }
        
        leftValues = remainder / 2d;
        if (remainder % 2 == 0)
        {
            lowestValue = leftValues;
        }
        else
        {
            lowestValue = Math.floor(leftValues);
        }
        if (scoreTopass - lowestValue <= 1)
        {
            return 1;
        }
        else if (scoreTopass - lowestValue <= 2 && surprisesLeft.get() > 0)
        {
            surprisesLeft.decrementAndGet();
            return 1;
        }
        else
        {
            return 0;
        }
    }
}
