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;
long long min(long long a, long long b, long long c) {
  return min(a, min(b, c));
}
template <class T>
const T& max(const T& a, const T& b, const T& c) {
  return max(a, max(b, c));
}
template <class T>
const T& min(const T& a, const T& b, const T& c) {
  return min(a, min(b, c));
}
struct sp {
  bool operator()(const pair<string, int>& a, const pair<string, int>& b) {
    if (a.second != b.second) {
      return (a.second > b.second);
    }
    return (a.first < b.first);
  }
};
long long stoi(string& str) {
  istringstream second(str);
  long long i;
  second >> i;
  return i;
}
string itos(long long i) {
  stringstream second;
  second << i;
  return second.str();
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
vector<int> v;
int n;
void dfs(int i) {
  if (i > n) return;
  v.push_back(i);
  dfs(10 * i);
  dfs(10 * i + 1);
}
int main() {
  int n, t, c;
  cin >> n >> t >> c;
  vector<int> v;
  int x;
  for (int i = 0; i < n; i++) {
    cin >> x;
    v.push_back(x);
  }
  int ct = 0;
  int i = 0, j = 0;
  while (true) {
    for (; i < n; i++)
      if (v[i] > t) break;
    int d = i - j;
    if (d >= c) ct += d - c + 1;
    j = i = i + 1;
    if (j >= n) break;
  }
  cout << ct << endl;
  return 0;
}
