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.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;

public class Main {

    StringTokenizer st = new StringTokenizer("");
    BufferedReader in;
    PrintWriter out;
    final String inputFile = "input.txt";
    final String outputFile = "output.txt";
    
    public void solve() throws Exception {
        int n=nextInt();
        int t=nextInt(), c=nextInt();
        int[] mas = new int[n];
        int[] prefics = new int[n+1];
        prefics[0]=0;
        for (int i=0; i<n; i++) {
            mas[i] = nextInt();
            prefics[i+1]=prefics[i]+(mas[i]>t ? 1 : 0);
        }
        int answer=0;
        for (int i=c-1; i<n; i++) {
            if (prefics[i+1]-prefics[i-c+1]==0) {
                answer++;
            }
        }
        out.println(answer);
    }
    
    public void run() throws Exception {
//      in = new BufferedReader(new FileReader(inputFile));
        in = new BufferedReader(new InputStreamReader(System.in));
        
//      out = new PrintWriter(new FileWriter(outputFile));
        out = new PrintWriter(System.out);
        
        solve();
        
        in.close();
        out.close();
        
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        try {
            new Main().run();
        } catch (Exception e) {
            // TODO: handle exception
            System.err.println(e);
        }
    }

    public String nextToken() throws Exception{
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
    
    public Integer nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }
    
    public Double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
    
    public Long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }
    
    public boolean EOF() throws Exception {
        while (!st.hasMoreTokens()) {
            String s = in.readLine();
            if (s==null) {
                return true;
            }
            st = new StringTokenizer(s);
        }
        return false;
    }
    
}
