#include <bits/stdc++.h>
long long R = 7 + 1e9, NUMTESTCASE;
const int NN = 10 + 1e5;
const double pi = acos(-1.0);
int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1},
    DI[8] = {1, 1, 0, -1, -1, -1, 0, 1}, DJ[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
int main() {
  int x, t, n, mx, k;
  cin >> n >> mx >> k;
  vector<int> a[n];
  t = 0;
  for (int i = (0); i <= (n - 1); ++i) {
    scanf("%d", &x);
    if (x <= mx)
      a[t].push_back(1);
    else
      t++;
  }
  int ans = 0;
  for (int i = (0); i <= (n - 1); ++i) ans += max(0, (int)a[i].size() - k + 1);
  cout << ans;
  return 0;
}
