CodeForces - 427B Prison Transfer

题意：

        给出一个长度为N的数串，问串中有几个数字不大于T且长度为C的子串

思路：

        扫一遍即可

代码：

#include <bits/stdc++.h>

using namespace std;
const int MAXN=2e5+100;
long long a[MAXN+10];
int main()
{
    long long n,t,c,temp,ans;
    ios::sync_with_stdio(false);
    while(cin>>n>>t>>c){
        for(int i=0;i<n;i++)
            cin>>a[i];
        temp=ans=0;
        for(int i=0;i<n;i++){
            if(a[i]<=t)
                temp++;
            else{
                ans+=max((long long)0,temp-c+1);
                temp=0;
            }
        }
        //cout<<temp<<endl;
        ans+=max((long long)0,temp-c+1);
        cout<<ans<<endl;
    }
}

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·10⁵), t (0 ≤ t ≤ 10⁹) and c (1 ≤ c ≤ n). The next line will contain n space separated integers, the i^th integer is the severity i^th prisoner's crime. The value of crime severities will be non-negative and will not exceed 10⁹.

Output

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

Example

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