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
""" 
How many ways can you choose prisoners to be 
transferred out of the city

Input
total_num_prisoners max_severity num_selected_prisoners
prisoner_data

Sample Input:
4 3 3
2 3 1 1
"""

import math

def inputs():
	# Collect Inputs
	total_pris, max_sev, num_choose = map(int, raw_input().split())
	prisoner_data = map(int, raw_input().split())
	return total_pris, max_sev,num_choose, prisoner_data

def choose_prisoners(total_pris,max_sev,num_choose,prisoner_data):
	# Return number of ways to choose prisoners

	# Test for how many contiguous sets there are
	segment = 0
	cont_set = 0
	for x in prisoner_data:
		if x <= max_sev:
			segment += 1
			if segment >= num_choose:
				cont_set +=1
		else:
			segment = 0
	return cont_set

def commence():
	# Wrapper function, bring it all together
	total_pris, max_sev,num_choose, prisoner_data = inputs()
	print choose_prisoners(total_pris,max_sev,num_choose,prisoner_data)

def test():
	print "Test 1"
	total_pris = 4
	max_sev = 3
	num_choose = 3
	prisoner_data = [2, 3, 1, 1]
	print "Actual: ",choose_prisoners(total_pris,max_sev,num_choose,prisoner_data)
	print "Expected: 2"
	print "-------------------"

	print "Test 2"
	total_pris = 1
	max_sev = 1
	num_choose = 1
	prisoner_data = [2]
	print "Actual: ",choose_prisoners(total_pris,max_sev,num_choose,prisoner_data)
	print "Expected: 0"
	print "-------------------"

	print "Test 3"
	total_pris = 11
	max_sev = 4
	num_choose = 2
	prisoner_data = [2, 2, 0, 7, 3, 2, 2, 4, 9, 1, 4]
	print "Actual: ",choose_prisoners(total_pris,max_sev,num_choose,prisoner_data)
	print "Expected: 6"
	print "-------------------"

if __name__ == '__main__':
	#test()
	commence()
