Codeforces Prison Transfer

Description

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.

Sample Input

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

【题目大意】
某市的监狱犯人关满了，需要从n个囚徒中选择c个转移至另外一个监狱，监狱长给出了选择的两个要求，让你计算有多少种方法然后输出方法数。
要求：
1.所选的囚徒必须都是连续的；
2.所选的囚徒中，每个囚徒的犯罪严重程度不超过t。

分段计算：

例如数据：

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

分成三段计算 第一段：3-2+1 第二段：4-2+1 第三段：2-2+1

#include<iostream>
using namespace std;
int main()
{
    int n,t,c,k,ans1,ans2;
    while (cin>>n>>t>>c)
    {
        ans1=ans2=0;
        for (int i=0; i<n; i++)
        {
            cin>>k;
            if(k>t) 分段计算
            {
                if(ans1>=c)
                {
                    ans2+=ans1-c+1;
                }
                ans1=0;
            }
            else
            {
                ans1++;
            }
        }
        if(ans1>=c)
        {
            ans2+=ans1-c+1;
        }
        cout<<ans2<<endl;
    }
}