#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
ll mod=(ll)1e9+7;
ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
int n,d,a;
vi arr;
int dp[4002][2][4002];
int ans(int idx,bool prv,int curd)
{
if(idx==n)return 0;
if(dp[idx][prv][curd]!=-1)
return dp[idx][prv][curd];
int e=1e18;
if(arr[idx]<=a||prv==1)
{
if((curd-1)>=0)
e=min(e,ans(idx+1,0,curd-1)+1);
e=min(e,ans(idx+1,(idx<n-1?arr[idx]>=arr[idx+1]:0),curd)+1);
}
else
e=ans(idx+1,0,curd);
return dp[idx][prv][curd]=e;
}
void preprocess() {}
void solve()
{
cin>>n>>d>>a;
arr.resize(n);
ent(arr);
memset(dp,-1,sizeof dp);
cout<<ans(0,0,d)<<endl;
}
signed main()
{
// freopen("meta_game_input.txt","r",stdin);
// freopen("otput.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
preprocess();
//bla();
int t=1;
//cin>>t;
while(t--)
solve();
}
