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
"""
-----------------------------Pseudo---------------------------------
"""
import copy
import sys
from collections import defaultdict, Counter
def input(): return sys.stdin.readline()
def mapi(): return map(int,input().split())
def maps(): return map(str,input().split())
#
def print(arg, *argv, sep="", end=None):
    sys.stdout.write(str(arg))
    for i in argv: sys.stdout.write(sep+str(i)) if sep else sys.stdout.write(" "+str(i))
    sys.stdout.write(end) if end else sys.stdout.write("\n")
#
def GCD(x, y): return GCD(y,x%y) if y else x
#
def modPow(x, y, p):
    res,x = 1,x%p
    while(y>0):
        if(y&1)==1: res=(res*x)%p
        y,x = y>>1,(x*x)%p
    return res
def modInv(s, mod): return modPow(s,mod-2,mod)
#---------------------------------------------------------------#



def solve():
    t = 1
    #t = int(input())
    while(t):
        t-=1
        n,x,c = mapi()
        a = list(mapi())
        res =0
        cnt = 0
        for i in range(n):
            if a[i]<=x:
                cnt+=1
            else:
                if cnt>=c:
                    res+=(cnt-c+1)
                cnt = 0
        if cnt >=c:
            res+=(cnt-c+1)
        print(res)



#---------------------------------------------------------------#

if __name__ == '__main__':
    solve()

