#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(c) (c).begin(), (c).end()
void solve(){
int N, D; cin>>N>>D;
vector<int> A(N);
for (int i=0;i<N;i++) cin>>A[i];
int ans = 0;
for (int mask=0;mask<(1<<(N-1));mask++){
vector<int> p;
for (int i=0;i<N-1;i++) if ((mask>>i)&1) p.push_back(i);
p.push_back(N-1);
bool ok = true;
int m = p.size();
for (int j=0;j+1<m;j++) ok &= p[j+1]-p[j] <= D;
if (!ok) continue;
int mx = 0;
int cnt = 0;
for (int j=0;j<m;j++){
cnt += A[p[j]] > mx;
mx = max(mx, A[p[j]]);
}
ans = max(ans, cnt);
}
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
}
