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);
	}

}

import java.io.*;
import java.util.*;
class DancingGooglers
{
    public static void main(String args[]) throws Exception
    {
        Scanner in = new Scanner(new File("B-large.in"));
        FileWriter out = new FileWriter(new File("B-large.out.txt"));
        int t = Integer.parseInt(in.nextLine());
        for(int x = 1; x <= t; x++)
        {
            String str = in.nextLine();
            Scanner sn = new Scanner(str);
            int n, s, p, y;
            n = sn.nextInt();
            s = sn.nextInt();
            p = sn.nextInt();
            y = 0;
            int scores[] = new int[n];
            for(int a = 0; a < n; a++)
            {
                scores[a] = sn.nextInt();
            }
            for(int score : scores)
            {
                int base = score/3;
                switch(score % 3)
                {
                    case 0 : 
                    {
                        if(base >= p)
                        {
                            y++;
                        }
                        else if(s > 0 && base > 0 && base + 1 >= p)
                        {
                            y++;
                            s--;
                        }
                    }
                    break;
                    case 1 : 
                    {
                        if(base >= p || base + 1 >= p)
                        {
                            y++;
                        }
                        else if(s > 0 && base + 1 >= p)
                        {
                            y++;
                            s--;
                        }
                    }
                    break;
                    case 2 : 
                    {
                        if(base + 1 >= p || base >= p)
                        {
                            y++;
                        }
                        else if(s > 0 && base + 2 >= p)
                        {
                            y++;
                            s--;
                        }
                    }
                }
            }
            System.out.println("Case #" + x + ": " + y);
            out.write("Case #" + x + ": " + y + "\n");
        }
        out.flush();
        out.close();
    }
}