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
#include <bits/stdc++.h>
using namespace std;
void start() {}
void sober() {
  long long int n, x = 0, a = 0, b = 0, y = 0, sum = 0, k = 0, m = 0, c = 0;
  cin >> n >> x >> c;
  vector<long long int> luffy, v(n);
  for (long long int i = 0; i < n; i++) {
    cin >> v[i];
    if (v[i] > x) luffy.push_back(i);
  }
  long long int ans = 0;
  long long int left, right;
  left = right = 0;
  if (!luffy.size()) {
    cout << n - c + 1 << "\n";
    return;
  }
  for (long long int i = 0; i < luffy.size(); i++) {
    if (!i) {
      if (luffy[i] < c) {
        continue;
      } else
        ans += luffy[i] - c + 1;
    } else {
      long long int temp = luffy[i] - luffy[i - 1] - 1;
      if (temp < c) continue;
      ans += temp - c + 1;
    }
  }
  if (n - 1 - luffy[luffy.size() - 1] >= c)
    ans += max(0LL, n - 1 - luffy[luffy.size() - 1] - c + 1);
  cout << ans << "\n";
  return;
}
signed main() {
  start();
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    sober();
  }
}
