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.util.HashMap;
import java.util.Map;

public class ProblemB {
	public static void main(String argv[])
	{
		IOSystem ioSystem = new IOSystem("problem/B-small-attempt0");
////		IOSystem ioSystem = new IOSystem("problem/A-small-attempt2");
//		IOSystem ioSystem = new IOSystem("problem/test");

		ioSystem.nextLong();
		while(ioSystem.hasNext())
		{
			int N = ioSystem.nextInt();
			int S = ioSystem.nextInt();
			int P = ioSystem.nextInt();

			int koeru = 0;
			int supKoeru = 0;

			for(int i=0;i<N;i++)
			{
				int t = ioSystem.nextInt();
				if(t==0)
				{
					if(P == 0)koeru++;
					continue;
				}
				if(t==1)
				{
					if(P <= 1)koeru++;
					continue;
				}



				//3ã¤ã«åãã
				if(t%3==0)
				{
					if(t/3>= P)
					{
						koeru++;
					}
					else if(t/3 + 1>= P)
					{
						supKoeru++;
					}
				}
				else if(t%3 == 2)
				{
					if(t/3 + 1>= P)
					{
						koeru++;
					}
					else if(t/3 + 2>= P)
					{
						supKoeru++;
					}
				}
				else
				{
					if(t/3 + 1 >= P)
					{
						koeru++;
					}
				}
			}

			System.out.println(N+","+S+","+P+","+koeru+","+supKoeru);

			if(supKoeru > S)
			{
				koeru += S;
			}
			else
			{
				koeru += supKoeru;
			}


			ioSystem.appendAnswer(koeru);
		}

		ioSystem.output();
	}
}


