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
//package CF;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Deque;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class B {

    public static void main(String[] args) throws IOException
    {
	Scanner bf = new Scanner(System.in);
	PrintWriter out = new PrintWriter(System.out);
	int n = bf.nextInt(), t = bf.nextInt(), c = bf.nextInt(), ways = 0;
	int [] a = new int[n];
	Deque<Integer> q = new LinkedList<Integer>();
	for (int i = 0; i < a.length; i++)
	{
	    a[i] = bf.nextInt();
	    if(i < c){
		while(!q.isEmpty() && a[q.peekLast()] < a[i])
		    q.pollLast();
		q.addLast(i);
	    }
	}
	for (int i = c-1; i < a.length; i++)
	{
	    if(i-c >= 0 && q.peekFirst() == i-c)
		q.removeFirst();
	    while(!q.isEmpty() && a[q.peekLast()] < a[i])
		q.pollLast();
	    q.addLast(i);
	    ways += a[q.getFirst()]<=t?1:0;
//	    out.println(i + " " + ways + " " + q.getFirst());
	}
	out.println(ways);
	out.flush();
	out.close();
    }
    static class Scanner{
	BufferedReader bf;
	StringTokenizer st;
	public Scanner(FileReader f){
	    bf = new BufferedReader(f);
	}
	public Scanner(InputStream f){
	    bf = new BufferedReader(new InputStreamReader(f));
	}

	public String next() throws IOException{
	    while(st == null || !st.hasMoreTokens())
		st = new StringTokenizer(bf.readLine());
	    return st.nextToken();
	}
	public int nextInt() throws NumberFormatException, IOException{
	    return Integer.parseInt(next());
	}
    }
}