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 B
{
	public static void main(String args[]) throws FileNotFoundException
	{
		Scanner in = new Scanner(new File(args[0]));

		int t;

		t = Integer.parseInt(in.nextLine());

		for (int i=0; i<t; i++)
		{
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int m = 0;

			int ti[] = new int[n];
			for (int j=0; j<n; j++)
			{
				ti[j] = in.nextInt();
			}

			for (int j=0; j<n; j++)
			{
				int d = ti[j]/3;
				int r = ti[j]%3;
				int x = p - d;

				if (x <= 0)
					m++;
				else if (x+d <= 10)
				{
					if (x==2 && r==2 && s>0)
					{
						m++;
						s--;
					}
					else if ( x == 1)
					{
						if (r==0 && d>0 && s>0)
						{
							m++;
							s--;
						}
						else if (r > 0)
							m++;
					}
				}
				if (m > n)
					m=n;
			}
			System.out.println("Case #" + (i+1) + ": " + m);
		}

	}
}
