package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancingwithgooglers;

import java.util.Scanner;

/**
 *
 * @author topik
 */
public class DancingWithGooglers
{

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args)
    {
        final Scanner scanner = new Scanner(System.in);
        final int testCases = scanner.nextInt();
        for( int tc=1; tc <= testCases; tc++ )
        {
            final int googlers = scanner.nextInt();
            int surprising = scanner.nextInt();
            final int p = scanner.nextInt();
            
            int goodGooglers = 0;
            
            for( int i=0; i < googlers; i++ )
            {
                final int score = scanner.nextInt();
                
                if( score == 0 )
                {
                    if( p == 0 )
                    {
                        goodGooglers++;
                    }
                    continue;
                }
                
                final int d = score / 3;
                final int r = score % 3;
                
                if( d >= p )
                {
                    goodGooglers++;
                }
                else if( d+1 >= p )
                {
                    if( r > 0 )
                    {
                        goodGooglers++;
                    }
                    else if( surprising > 0 )
                    {
                        surprising--;
                        goodGooglers++;
                    }
                }
                else if( d+2 >= p )
                {
                    if( r == 2 && surprising > 0 )
                    {
                        surprising--;
                        goodGooglers++;
                    }
                }
            }
            
            System.out.println("Case #" + tc + ": " + goodGooglers);
        }
    }
}
