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.*;

/*
 * This file was created by ayush in attempt to solve the problem 427B
 */
public class PrisonTransfer {
    public void solve(int[] input,int n,int t,int c, PrintWriter out) {
        int ans = 0;
        int[] temp = new int[n+5];
        temp[0]=-1;
        int index = 0;
        for (int i = 0; i <n ; i++) {
            if(input[i]>t){
                temp[++index] = i;
            }
        }
        temp[++index]=n;
        if(index==0){
            ans=n-c+1;
        }else{
            int distance =0;
            for (int i = 1; i <index+1 ; i++) {
                distance = temp[i]-temp[i-1]-1;

                ans += Math.max(distance - c + 1,0);

            }
        }
        out.println(ans);
    }

    public static void main(String[] args)throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        int[] ntc = IOUtils.readLinearIntArray(in);
        PrisonTransfer solver = new PrisonTransfer();
        int[] input  = IOUtils.readLinearIntArray(in);
        solver.solve(input,ntc[0],ntc[1],ntc[2], out);
        out.flush();
        out.close();
    }

    static class IOUtils{
        public static int[] readLinearIntArray(BufferedReader in)throws IOException {
            //in.nextLine();
            String[] arr = in.readLine().split(" ");
            int[] array = new int[arr.length];
            for (int i = 0; i < arr.length; i++)
                array[i] = Integer.parseInt(arr[i]);
            return array;
        }

    }
}