#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
void solve()
{
int n,d,t;
cin >> n >> d >> t;
vector<int> v(n);
rep(i,n) cin >> v[i];
vector<int> ans_pref(n);
vector<int> ans_suf(n+1,0);
int max_end = -1;
int ans = 0;
rep(i,n)
{
if(v[i] <= t)
{
max_end = max(max_end,i + t-v[i]);
}
if(i <= max_end)
{
ans++;
}
ans_pref[i] = ans;
}
reverse(all(v));
ans = 0;
int pop = -1;
rep(i,n)
{
if(v[i] <= t)
{
int odl = v[i]-t;
int a = 1;
rep(j,odl)
{
if(v[i] > t)
{
a++;
}
else
{
break;
}
}
if(pop == -1) ans_suf[n-i-1] = a;
else ans_suf[n-i-1] = a+ans_suf[pop];
pop = n-i-1;
}
else ans_suf[n-i-1] = ans_suf[n-i];
}
int ans_ = n;
rep(i,n)
{
// cout << ans_pref[i] << " " << ans_suf[i] << " ans\n";
if(i == n-1)
{
ans_ = min(ans_,ans_pref[n-1]);
}
else ans_ = min(ans_,ans_pref[i]+ans_suf[i+1]);
}
cout << ans_ << "\n";
}
int main()
{
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random();
int t = 1;
//cin >> t;
while(t--) solve();
}
