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

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author Serban
 */
public class Input {
    
    PrintWriter out;

    public Input(String fileName) {
        //C-large-practice.in
        try {
            out = new PrintWriter(new File("result.txt"));
            Scanner scan = new Scanner(new File(fileName));
            int T = scan.nextInt();
            scan.nextLine();
            for (int i = 0; i < T; i++) {
                int N = scan.nextInt();
                int S = scan.nextInt();
                int p = scan.nextInt();
                int[] marks = new int[N]; 
                for(int j=0;j<N;j++) {
                    marks[j] = scan.nextInt();
                }
                solve(N, S, p, marks, i);
            }
            out.close();
        } catch (Exception e) {
            System.out.println(e.getMessage());
        }
    }
    
    private void solve(int N, int S, int p, int[] marks, int testCase) {
        out.print("Case #" + (testCase + 1) + ": ");
        int nr = 0;
        int leftS = S;
        for(int i=0;i<N;i++) {
            //System.out.print(marks[i]+" ");
            int c = marks[i];
            switch(p) {
                case 0:
                    nr++;
                    break;
                case 1:
                    if(c>=1)
                        nr++;
                    break;
                default:
                    if(c >= 3*p-2)
                        nr++;
                    else
                        if(leftS > 0 && c >= 3*p-4) {
                            nr++;
                            leftS--;
                        }
            }
        }
        System.out.println(nr);
        out.print(nr);
        out.println();
        out.flush();
    }
}
