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

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package leider.ken;

import java.io.*;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.concurrent.Callable;

/**
 *
 * @author ken
 */
public class DancingParser implements Parser {

    public Map<Integer, Callable<String>> parse(String fileName) throws IOException {
        Map<Integer, Callable<String>> retval = new HashMap<Integer, Callable<String>>();
        BufferedReader reader = new BufferedReader(new FileReader(fileName));
        int testCases = Integer.parseInt(reader.readLine());
        for (int i = 1; i <= testCases; i++) {
            String[] tokens = reader.readLine().split("\\s+");
            
            long surprises = Long.parseLong(tokens[1]);
            long minScore = Long.parseLong(tokens[2]);
            
            List<Long> totals = new ArrayList<Long>();
            for (int j = 3; j < tokens.length; j++) {
                totals.add(Long.parseLong(tokens[j]));
                
            }
            retval.put(i, new DancingAlgorithm(i, surprises, minScore, totals));
        }
        
        return retval;

    }
    
}
