Range Selection 1

Problem Description

You are given $n$ numbers $a_1, a_2, ..., a_n$ and an integer $k$. You need to choose $c$ consecutive numbers from these $n$ numbers such that the maximum among the $c$ numbers does not exceed $k$. How many ways are there to do this?

Input Format

The first line contains three integers $n, k, c$.

The next line contains $n$ integers $a_1, a_2, ..., a_n$.

Output Format

Output one line containing a number: the answer.

Sample Input 1

3 2 2
3 2 1

Sample Output 1

1

Sample Input 2

10 2 3
2 0 0 7 1 2 2 1 5 1

Sample Output 2

3

Constraints

For $100\%$ of the data, $1 \leq c \leq n \leq 10^6, 0 \leq a_i, k \leq 10^9$.