#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
class BIT{
vi bit;ll N;
public:
ll sum(ll i){
chmin(i,N);
ll res=0;
for(ll j=i-1;j>=0;j=(j&(j+1))-1)res+=bit[j];
return res;
}
BIT(ll n):N(n){bit.resize(N);}
void add(ll i,ll x){
for(int j=i;j<N;j|=j+1)bit[j]+=x;
}
ll get(ll a,ll b){
return sum(b)-sum(a);
}
};
class UF{
vi data;stack<P> st;
public:
UF(ll n){
data=vi(n,1);
}
bool merge(ll x,ll y,bool undo=false){
x=root(x);y=root(y);
if(data[x]>data[y])swap(x,y);
if(undo){st.emplace(y,data[y]);st.emplace(x,data[x]);}
if(x==y)return false;
data[y]+=data[x];data[x]=-y;
return true;
}
ll root(ll i){if(data[i]>0)return i;return root(-data[i]);}
ll getsize(ll i){return data[root(i)];}
bool same(ll a,ll b){return root(a)==root(b);}
void undo(){rep(i,2){data[st.top().fi]=st.top().se;st.pop();}}
};
int main(){
ll n,d,k;cin>>n>>d>>k;
vi v(n);rep(i,n)cin>>v[i];
vp t1,t2;
ll ans=0,cur=0;
vi par(n+1,-1);
rep(i,n){
if(v[i]>k){
while(t1.size()&&t1.back().fi+i-t1.back().se>k)t1.pop_back();
if(t1.size()==0)ans++;
else{
while(t2.size()&&t2.back().fi>=t1.back().se){
par[t2.back().se]=cur;t2.pop_back();
}
t2.pb(t1.back().se,cur);
cur++;
}
}
else t1.pb(v[i],i);
}
while(par.size()!=cur+1)par.pop_back();
for(auto x:t2)par[x.se]=cur;
// outv(par);
ll m=par.size();
vvi g(m);
rep(i,m-1)g[par[i]].pb(i);
vp ma(m);
function<void(ll)> dfs=[&](ll i){
ma[i]=P(1,i);
for(ll x:g[i]){
dfs(x);
chmax(ma[i],P(ma[x].fi+1,ma[x].se));
}
};dfs(m-1);
PQ(P) pq;
pq.push(ma[m-1]);
vb done(m,false);
rep(i,d){
if(!pq.size())break;
auto t=pq.top();pq.pop();
ans+=t.fi;
for(ll x:g[t.se])pq.emplace(ma[x]);
while(par[t.se]!=-1&&!done[par[t.se]]){
done[t.se]=true;
for(ll x:g[par[t.se]])if(x!=t.se)pq.emplace(ma[x]);
t.se=par[t.se];
}
done[t.se]=true;
}
out(n-ans+1);
}
