The prison of your city has n prisoners. As the prison can't accommodate all of them, the city mayor has decided to transfer c of the prisoners to a prison located in another city.

For this reason, he made the n prisoners to stand in a line, with a number written on their chests. The number is the severity of the crime he/she has committed. The greater the number, the more severe his/her crime was.

Then, the mayor told you to choose the c prisoners, who will be transferred to the other prison. He also imposed two conditions. They are,

  * The chosen c prisoners has to form a contiguous segment of prisoners. 
  * Any of the chosen prisoner's crime level should not be greater then t. Because, that will make the prisoner a severe criminal and the mayor doesn't want to take the risk of his running away during the transfer. 



Find the number of ways you can choose the c prisoners.

Input

The first line of input will contain three space separated integers n (1 ≤ n ≤ 2·105), t (0 ≤ t ≤ 109) and c (1 ≤ c ≤ n). The next line will contain n space separated integers, the ith integer is the severity ith prisoner's crime. The value of crime severities will be non-negative and will not exceed 109. 

Output

Print a single integer — the number of ways you can choose the c prisoners.

Examples

Input

4 3 3
2 3 1 1


Output

2


Input

1 1 1
2


Output

0


Input

11 4 2
2 2 0 7 3 2 2 4 9 1 4


Output

6
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class PrisonTransfer {
    static int INF = Integer.MIN_VALUE;
    static int nums[], segTree[] = new int[2 * 5 * 100000];
    static int N;

    static void init() {
        Arrays.fill(segTree, INF);
        build(0, 0, N - 1);
    }

    static void build(int node, int l, int r) {
        if (l == r) {
            segTree[node] = nums[l];
            return;
        }
        int mid = (l + r) >> 1;
        build(node * 2 + 1, l, mid);
        build(node * 2 + 2, mid + 1, r);
        segTree[node] = Math.max(segTree[node * 2 + 1], segTree[node * 2 + 2]);
    }

    static int query(int node, int l, int r, int i, int j) {
        if (l > j || r < i)
            return INF;
        if (l >= i && r <= j)
            return segTree[node];
        int mid = (l + r) >> 1;
        return Math.max(query(node * 2 + 1, l, mid, i, j),
                query(node * 2 + 2, mid + 1, r, i, j));
    }

    public static void main(String[] args) throws NumberFormatException,
            IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String l[] = bf.readLine().split(" ");
        N = Integer.parseInt(l[0]);
        int t = Integer.parseInt(l[1]);
        int c = Integer.parseInt(l[2]);
        l = bf.readLine().split(" ");
        nums = new int[N];
        for (int i = 0; i < N; i++) {
            nums[i] = Integer.parseInt(l[i]);
        }
        init();
        int ans = 0, q;
        for (int i = 0; i + c <= N; i++) {
            q = query(0, 0, N - 1, i, i + c-1);
            //System.out.println(i + " " + q);
            if (q <= t)
                ans++;
        }
        System.out.println(ans);
    }
}
