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 main;
import java.util.*;
import java.io.*;
import java.math.BigInteger;

public class Main {
    FastScanner scan;
    PrintWriter out;
    BufferedReader in;
    static BigInteger fact(BigInteger b)
    {
        BigInteger p =BigInteger.ONE;
        for (BigInteger i = BigInteger.ONE; i.compareTo(b.add(BigInteger.ONE))==-1; i=i.add(BigInteger.ONE))
        {
            p = p.multiply(i);
        }
        return p;
    }
    static boolean isPrime(long n)
    {
       for (int i=2; i<=Math.sqrt((double)n); i++)
       {
           if(n%i==0)
           {
               return false;
           }
       }
       return true;
    }
    public void solve() throws Exception {
        int n = scan.nextInt(), t = scan.nextInt(), m = scan.nextInt();
        int counter =0;
        int sum = 0;
        for (int i=0; i<n; i++)
        {
            int num = scan.nextInt();
            if(num<=t)
            {
                sum++;
            }
            else
            {
                if(sum>=m) 
                counter = counter+sum-m+1;
                
                sum=0;
            }
        }
        if(sum>=m)
        {
            counter =counter+sum-m+1;
        }
        out.println(counter);
    }
static Throwable uncaught;
    public void run() {
        try {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            scan = new FastScanner(in);
            solve();
        } catch (Throwable uncaught) {
            Main.uncaught = uncaught;
        }
        finally
        {
            out.close();
        }
    }

    class FastScanner {
        BufferedReader in;
        StringTokenizer st;
        
        FastScanner(BufferedReader in) {
           this.in = in;
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(in.readLine());
            }
            return st.nextToken();
        }
        public long nextLong() throws Exception {
		return Long.parseLong(next());
	}

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

        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
        BigInteger nextBig() throws IOException
        {
            return new BigInteger(next());
        }
        
    }

    public static void main(String[] arg) {
        new Main().run();
    }
}