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.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Parser {

	private Scanner sc;
	private int ncases;
	private int curcase;

	public Parser(String inputFile) throws FileNotFoundException {
		InputStream input = (inputFile == null) ? System.in : new FileInputStream(new File(inputFile));
		sc = new Scanner(input);
		ncases = sc.nextInt();
	}
	
	public boolean hasNext() {
		return ncases > curcase;
	}

	public Case nextCase() {
		if (!hasNext())
			return null;
		curcase++;
		int n = sc.nextInt();
		int s = sc.nextInt();
		int p = sc.nextInt();
		List<Integer> g = new ArrayList<Integer>(n);
		for (int i = 0; i < n; i++)
			g.add(sc.nextInt());
		return new Case(curcase, n, s, p, g);
	}

}