#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#include <random>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
clock_t startTime;
double getCurrentTime() {
return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}
#define MP make_pair
typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 1111;
int a[N];
pair<int, int> dp[N];
pair<int, int> MAX(pair<int, int> foo, pair<int, int> hoo) {
if (foo.first > hoo.first) return foo;
if (foo.first < hoo.first) return hoo;
return (foo.second < hoo.second ? foo : hoo);
}
int n;
pair<int, int> t[N];
void update(int pos, int v = 1, int tl = 1, int tr = n) {
if (tl == tr) {
t[v] = dp[tl];
return;
}
int tm = (tl + tr) >> 1;
if (pos <= tm) update(pos, v << 1, tl, tm);
else
update(pos, v << 1 | 1, tm + 1, tr);
t[v] = MAX(t[v << 1], t[v << 1 | 1]);
}
pair<int, int> get(int l, int r, int v = 1, int tl = 1, int tr = n) {
if (l <= tl && tr <= r) return t[v];
if (tl > r || tr < l) return MP(0, 0);
int tm = (tl + tr) >> 1;
return MAX(get(l, r, v << 1, tl, tm), get(l, r, v << 1 | 1, tm + 1, tr));
}
void solve(int TC) {
int d;
cin >> n >> d;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i]++;
}
int ans = 0;
for (int k = 1; k <= n; k++) {
dp[k] = MP(1, a[k]);
for (int i = k + 1; i <= n; i++) {
for (int j = max(k, i - d); j < i; j++){
if (dp[j].second < a[i]){
dp[i] = MAX(dp[i], MP(dp[j].first + 1, a[i]));
} else {
dp[i] = MAX(dp[i], dp[j]);
}
}
}
ans = max(ans, dp[n].first);
}
cout << ans << endl;
}
int main() {
startTime = clock();
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#ifdef dddxxz
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int TC = 1;
// cin >> TC;
for (int test = 1; test <= TC; test++) {
//debug(test);
//cout << "Case #" << test << ": ";
solve(test);
}
#ifdef dddxxz
cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif
return 0;
}
