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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.*;
import java.util.*;
import java.lang.*;

/**
 *
 * @author Bryan AW
 */
public class Codeforces {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        
        //Prison Transfer
        
        Scanner sc=new Scanner(System.in); 
        
        int n, t, c;
        
        n=Integer.parseInt(sc.next());
        t=Integer.parseInt(sc.next());
        c=Integer.parseInt(sc.next());
        
        int[] v=new int[n];
        
        int idx=0, ans=0;
        
        for (int i=0;i<n;i++){
            v[i]=Integer.parseInt(sc.next());
            if (v[i]>t){
                int x=i-idx;
                if (x>=c){
                    ans+=(x-c+1);
                }
                idx=i+1;
            }
        }
        
        if (v[n-1]<=t){
            int x=n-idx;
            if (x>=c){
                ans+=(x-c+1);
            }
        }
        
        System.out.print(ans);
        
        System.out.println();
        
    }
    
}