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.*;
import java.util.*;

public class CodeForces {
    public static void main(String[] args)throws IOException {
        //MyScanner sc = new MyScanner(new FileReader("input.txt"));
        //PrintWriter out = new PrintWriter("output.txt");
        PrintWriter out = new PrintWriter(System.out);
        MyScanner sc = new MyScanner(System.in);
        long ans = 0 ;
        int n ,t , c;
        n =sc.nextInt();
        t = sc.nextInt();
        c = sc.nextInt();
        int [] arr = new int[n];
        for(int i = 0 ; i < n ; i ++)
            arr[i] = sc.nextInt();
        for(int i = 0 ; i < n ; i ++)
        {
            if(arr[i] > t){arr[i] = 0 ;}
            else{
                arr[i] = 1;
            }
        }
        int cnt = 0 ;
        for(int i = 0 ; i < n; i ++)
        {
            if(arr[i] == 1)cnt++;
            else{
                if(cnt >= c){
                   ans+=(cnt-c+1);
                   cnt = 0;
                }
                else{
                    cnt = 0 ;
                }
            }
        }
        if(cnt >= c){
            ans+=(cnt-c+1);
        }
        out.print(ans);
        out.flush();
        out.close();

    }


    static long gcd(long a, long b) { return b==0 ? a : gcd(b, a % b); }
    static long lcm(long a, long b) { return (a / gcd(a, b)) * b; }
    static class MyScanner
    {
        StringTokenizer st;
        BufferedReader br;

        public MyScanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

        public MyScanner(FileReader s) throws FileNotFoundException {	br = new BufferedReader(s);}

        public String next() throws IOException
        {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

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

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

        public String nextLine() throws IOException {return br.readLine();}

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

        public boolean ready() throws IOException {return br.ready();}
    }
}