#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)));
}
int curr=0,tots=0;
vector<int>foreach(n+1,0);
priority_queue<pii,vector<pii>,greater<pii>>endcell;
set<int>holdings;
for(int a=1;a<=n;a++)
{
while(!pq.empty()&&pq.top().ff<=a)
{
curr++;
endcell.push(pq.top().ss);
holdings.insert(pq.top().ss.ss);
pq.pop();
}
while(!endcell.empty()&&endcell.top().ff<a)
{
curr--;
holdings.erase(endcell.top().ss);
endcell.pop();
}
if(curr>=1)tots++;
if(curr==1)
{
foreach[*holdings.begin()]++;
}
}
int ans=0;
for(int a=1;a<=n;a++)
{
ans=max(ans,foreach[a]);
}
cout<<(tots-ans);
}
