package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

package com.google.code;

import java.io.IOException;

public class B extends GCJ {

	protected B() throws IOException {
		super();
	}

	@Override
	protected void code(int count) throws IOException {
		readLine();
		int N = getIntInput(0);
		int S = getIntInput(1);
		int p = getIntInput(2);
		
		int limitForOrdinary = p + (p - 1 < 0 ? p : p - 1) * 2;
		int result = 0;
		for (int i = 0; i < N; i++) {
			int googler = getIntInput(3 + i);
			if (googler>= limitForOrdinary) {
				result ++;
				continue;
			}
			if (S>0)
				if (googler>1 && googler+2 >=limitForOrdinary) {
					S--;
					result++;
					continue;
				}			
		}
		writeln(result);
	}
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		new B().run();
}
}
