#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = (int)1e6 + 12;

int n, d, a[N], dp[N];
void test() {
    cin >> n >> d;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int res = 1;
    for(int i = 1; i <= n; i++) {
        dp[i] = max(dp[i], 1);
        int lst = i;
        for(int j = i + 1; j  <= n; j++) {
            if(j - lst > d) break;
            if(a[j] <= a[i]) {
                lst = j;
            }
            if(a[j] > a[i]) {
                dp[j] = max(dp[j], dp[i] + 1);
            }
        }
        res = max(res, dp[i]);
    }

    cout << res << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    //cin >> t;

    while(t--)
        test();

    return 0;
}