#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
cerr << #x << " : ";\
for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
cerr << "outputting" << #j<< ":\n";\
for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}
signed main()
{
int t1,t2,t3,t4;
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,d,t;cin>>n>>d>>t;
priority_queue<piii,vector<piii>,greater<piii>>pq;
for(int a=1;a<=n;a++)
{
cin>>t1;
if(t1<=t)pq.push(mp(a,mp(a+(t-t1),a)));
}
set<int>curr;
priority_queue<pii,vector<pii>,greater<pii>>ends;
vector<int>foreach(n+1,0);
for(int a=1;a<=n;a++)
{
while(!pq.empty()&&pq.top().ff<=a)
{
curr.insert(pq.top().ss.ss);
ends.push(pq.top().ss);
pq.pop();
}
while(!ends.empty()&&ends.top().ff<a)
{
curr.erase(ends.top().ss);
ends.pop();
}
if(!curr.empty())
{
foreach[a]=(*prev(curr.end()));
}
}
int ans=n,currans=0;
priority_queue<int>hav;
for(int a=1;a<=n;a++)
{
currans+=(foreach[a]==0?0:1);
}
for(int a=n;a>=1;a--)
{
if(foreach[a]!=0)
{
currans--; //is safe now!
hav.push(foreach[a]); //won't be safe when this guy enters the section too
}
while(!hav.empty()&&hav.top()>=a)
{
hav.pop();
currans++; //not safe anymore
}
ans=min(ans,currans);
}
cout<<ans;
}
