import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.io.*;
import java.util.*;

class Dancing
{
    public static void main(String[] args) throws IOException
    {
        Scanner s = new Scanner(new File(args[0]));

        int numTests = s.nextInt();

        for (int i = 1; i <= numTests; i++)
        {
            // Get rid of prepending newline.
            s.nextLine();

            int count = 0;

            int N = s.nextInt();
            int S = s.nextInt();
            int p = s.nextInt();

            for (int j = 0; j < N; j++)
            {
                int t = s.nextInt();
                int a = t / 3 + ((t % 3 == 0) ? 0 : 1);
                
                if (a >= p)
                {
                    count++;
                }
                else if (a == p-1 && S > 0 && t > 1 && t % 3 != 1)
                {
                    count++;
                    S--;
                }
            }

            System.out.println("Case #" + i + ": " + count);
        }
    }
}
