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>.
def transferCombos():
    line = input()

    nFound = False
    tFound = False
    n = ""
    t = ""
    c = ""
    for i in line:
        if i != " " and not nFound:
            n += i
        elif i != " " and nFound and not tFound:
            t += i
        elif tFound and nFound:
            c += i
        elif i == " " and not nFound:
            nFound = True
        elif i == " " and nFound and not tFound:
            tFound = True
    t = int(t)
    c = int(c)
    n = int(n)

    prisoners = input()
    severities = []
    curr = ""
    for i in prisoners:
        if i == " ":
            severities.append(int(curr))
            curr = ""
        else:
            curr += i

    index = 0
    contiguous = []
    currP = 0
    for i in severities:
        if i <= t:
            currP += 1
            index += 1
        if i > t:
            contiguous.append(currP)
            currP = 0

    if index == 0:
        return 0

    total = 0
    for i in contiguous:
        total += combinations(i, c)

    print(total)

def combinations(n: int, k: int):
    if k > n/2:
        k = n-k

    ans = 1
    for i in range(k):
        ans = (ans*(n-1))/(i+1)

    return int(ans)

transferCombos()
		  			   	 	 				   	  				 		