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>.
v = []
numy,crime,num = map(int,input().split())
nums= list(map(int,input().split()))
for i in range(num):
    v.append(nums[i:])
x =[*zip(*v)]

count = 0
for j in x:
    p = "yes"
    for l  in j:
        if l>crime:
            p = "no"
            break
    if p == "yes":
        count+=1       
print(count)