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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Hashtable;
import java.util.StringTokenizer;

public class Main2 {
	public static void main(String[] args) throws Exception {
		Main2 mainClass = new Main2();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer st;

	// This just returns next token from the input stream
	public String next() throws Exception {
		if (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(in.readLine());
		}
		return st.nextToken();
	}

	public int nextInt() throws Exception {
		return Integer.parseInt(next());
	}

	public double nextDouble() throws Exception {
		return Double.parseDouble(next());
	}

	public long nextLong() throws Exception {
		return Long.parseLong(next());
	}

	public Main2() throws Exception {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(new OutputStreamWriter(System.out));

		solve();
		out.close();
	}

	public void solve() throws Exception {
		int n = nextInt();
		int t = nextInt();
		int c = nextInt();
		int[] arr = new int[n];
		int count = 0;
		int diff;

		int[] dangerIdx = new int[n+2];
		int k = 0;
		dangerIdx[k++] = -1;
		for (int i = 0; i < n; i++) {
			arr[i] = nextInt();
			if (arr[i] > t)
				dangerIdx[k++] = i;
		}
		dangerIdx[k++] = n;
		
		for (int j = 0; j < k - 1; j++) {
			diff = dangerIdx[j + 1] - dangerIdx[j];
			if (diff >= c) {
				count += diff - c;
			}
		}

		out.println(count);
	}
}