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.
The first line of input will contain three space separated integers *n* (1 ≤ *n* ≤ 2·10<sup class="upper-index">5</sup>), *t* (0 ≤ *t* ≤ 10<sup class="upper-index">9</sup>) and *c* (1 ≤ *c* ≤ *n*). The next line will contain *n* space separated integers, the *i*<sup class="upper-index">*th*</sup> integer is the severity *i*<sup class="upper-index">*th*</sup> prisoner's crime. The value of crime severities will be non-negative and will not exceed 10<sup class="upper-index">9</sup>.
# n,t,c=map(int,input().strip().split())
# li=list(map(int,input().strip().split()))
# di={}
# i=0
# # fli=[]
# while i<n:
#     ct=0
#     si=i
#     maxi=li[i]
#     while ct<c and i<n:
#         if li[i]>maxi:
#             maxi=li[i]
#         ct+=1
#         i+=1
#     # lii=[maxi]*c
#     # fli=fli+lii
#     for j in range(si,i):
#         di[j]=maxi
# ans=0
# si=0
# print(di)
# for i in range(0,n-c+1):
    
#     if di[i]<=t:
#         ans+=1
# print(ans)


# i=0
# ct=0
# si=i
# maxi=li[i]
# while ct<c and i<n:
#     if li[i]>maxi:
#         maxi=li[i]
#     ct+=1
#     i+=1
# di[si]=maxi
# print(di)
# for i in range(1,n-c+1):
#     if li[c-1+i]>maxi:
#         maxi=li[c+i-1]
#     di[i]=maxi

# print(di)
# ans=0
# si=0
# # print(di)
# for i in range(0,n-c+1):
    
#     if di[i]<=t:
#         ans+=1
# print(ans)

def x_less_than_or_equal_n(x, n):
    return x <= n;
 
n, t, c = list(map(int, input().split()))
prisoners_crimes = list(map(int, input().split()))
 
result = counter = 0
 
for i in range(n):
    if x_less_than_or_equal_n(prisoners_crimes[i], t):
        counter += 1
    else:
        counter = 0
        
    if counter >= c:
        result += 1
    
print(result)










