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.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class ar {

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
static boolean[] seen;
static int[][] a2;
static Map<Integer,Integer> map;
static Set<Character> charset ;
static Set<Integer> set;

static int[]arr;
public static void main(String[] args) throws java.lang.Exception {
        FastReader scn = new FastReader();
int n=scn.nextInt();
long t=scn.nextLong();
long c=scn.nextLong();


arr=new int[n];

for(int i=0;i<n;i++){
arr[i]=scn.nextInt();
}




long ans=0;

int left=0;
int right=0;

while(right<c && right<n && arr[right]<=t){
    right++;
}
if(right==c){
    ans++;
}

if(right<n){

if(right==c){
    left=1;
}else{
    left=right+1;
    right=left;
}

while(right<n){


if(arr[right]>t){
    right=right+1;
    left=right;
}else{
    if (right - left + 1 == c)
        {  left++;
            ans++;
        }
right++;        
}


}



}






System.out.print(ans+"\n");



}


}