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

}
package com.vlad;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class B {
    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(new File(args[0]));
        FileWriter writer = new FileWriter("b-out.txt");
        int T = scanner.nextInt();
        for(int i=0;i<T;i++) {
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int P = scanner.nextInt();
            int[] RES = new int[N];
            
            for(int j=0;j<N;j++) {
                RES[j] = scanner.nextInt();
            }

            if(i>0) {
                writer.append("\n");
            }
            writer.append("Case #"+(i+1)+": " + solve(N,S,P,RES));
        }
        writer.flush();
    }

    private static int solve(int n, int s, int p, int[] res) {
        int num = 0;
        int surLeft = s;
        for(int i=0;i<n;i++) {
            if(p+Math.max(0,p-1)*2<=res[i]) {
                num++;
            } else {
                if(surLeft>0) {
                    if(p+Math.max(0,p-2)*2<=res[i]) {
                        surLeft--;
                        num++;
                    }
                }
            }
        }
        return num;
    }
}
