#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <random>
//#define int long long
#define loop(X, N) for (int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
int main() {
int n, d, t;
cin >> n >> d >> t;
int lastI = -1;
int mx = n + 2;
int result = 0;
vii freq(n);
loop(i, n)
freq[i].second = i;
/*
5 1 5
1 10 1 10 10
*/
vi a(n);
loop(i, n) {
cin >> a[i];
if (a[i] <= t) {
result++;
if (a[i] <= mx) {
mx = a[i];
lastI = i;
}
}
else {
if (lastI != -1 && mx <= t)
freq[lastI].first++;
}
mx++;
}
sort(all(freq));
for (int i = 0; i < n - d; i++) {
result += freq[i].first;
}
cout << result << endl;
return 0;
}
