//♥God will make a way♥
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
int a[300005], b[300005], l[300005]; //amenamotik >=y
int pref[300005], dp[7007][7007]; //in verjin elemna, jn maxi arjeqy
// struct segtree {
// vector <ll> tree;
// int size = 1;
// void init(int n) { //make tree
// while(size < n) size *= 2;
// tree.assign(2 * size - 1, INT_MIN);
// }
// void build(vector<ll> &a, int x, int lx, int rx) { //build tree
// if(rx - lx == 1) {
// if(lx < a.size()) tree[x] = a[lx];
// }
// else {
// int m = (lx + rx) / 2;
// build(a, 2 * x + 1, lx, m);
// build(a, 2 * x + 2, m, rx);
// tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
// }
// }
// void build(vector<ll> &a) {
// init(a.size());
// build(a, 0, 0, size);
// }
// void upd(int i, ll v, int x, int lx, int rx) {
// if(rx - lx == 1) {
// tree[x] = v;
// return;
// }
// int m = (lx + rx) / 2;
// if(i < m) upd(i, v, 2 * x + 1, lx, m);
// else upd(i, v, 2 * x + 2, m, rx);
// tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
// }
// void upd(int i, ll v) { //set i-th to v
// upd(i, v, 0, 0, size);
// }
// long long qry(int l, int r, int x, int lx, int rx) {
// if(l >= rx || lx >= r) return INT_MIN;
// if(lx >= l && rx <= r) return tree[x];
// int m = (lx + rx) / 2;
// return max(qry(l, r, 2 * x + 1, lx, m), qry(l, r, 2 * x + 2, m, rx));
// }
// int qry(int l, int r) {
// return qry(l, r, 0, 0, size);
// }
// } ft[7007];
multiset<int> multi[7007];
int main() {
fastio;
int n, d; cin >> n >> d; fra(n)
vi compress; fri(n) compress.pb(a[i]);
sort(all(compress)); uniq(compress);
fri(n) a[i] = lb(all(compress), a[i]) - compress.begin();
stack<pii> st;
st.push({a[0], 0});
fill(l, l + n, -1);
frr(1, n) {
pii p = st.top();
while(p.ff < a[i]) {
st.pop();
if(st.size()) p = st.top();
else break;
}
if(st.size()) {
p = st.top();
l[i] = p.ss;
}
st.push({a[i], i});
}
if(d == 1) {
int ans = 0;
fri(n) {
pref[l[i] + 1]++;
pref[i+1]--; //ete skizby iranic aj=>imast chka
}
frr(1, n) pref[i] += pref[i-1];
fri(n) ans = max(ans, pref[i]);
cout << ans;
} else if(d == n) {
b[0] = a[0]; int m = 1;
frr(1, n) {
if(a[i] > b[m-1]) {
b[m] = a[i];
m++;
} else {
int it = lb(b, b + m, a[i]) - b;
b[it] = a[i];
}
}
cout << m;
} else {
// fri(n) ft[i].init(n+1);
frr(a[0], n) dp[0][i] = 1;
frr(1, n) {
dp[i][a[i]] = 1;
for(int j = i-1; i-j<=d && j >= 0; j--)
dp[i][a[i]] = max(dp[i][a[i]], dp[j][a[i]]);
if(a[i])
for(int j = i-1; i-j<=d && j >= 0; j--)
dp[i][a[i]] = max(dp[i][a[i]], dp[j][a[i]-1] + 1);
frrj(a[i]+1, n) {
if(multi[j].size()) {
int x = *prev(multi[j].end());
dp[i][j] = max(dp[i][j], x);
}
}
frj(n) {
if(i-d>=0) {
auto it = multi[j].find(dp[i-d][j]);
if(it != multi[j].end())
multi[j].erase(it);
}
}
frj(n) multi[j].insert(dp[i][j]);
frrj(1, n) dp[i][j] = max(dp[i][j], dp[i][j-1]);
}
// fri(n) print(dp[i], n);
int ans = 0; fri(n) ans = max(ans, dp[i][n-1]);
cout << ans;
}
return 0;
}
