#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 = 0;
    for(int i = 1; i <= n; i++) {
        dp[i] = 1;
        for(int j = i - 1; j >= 1; j--) {
            if(a[j] < a[i]) {
                int lst = j;
                bool ok = 1;
                for(int k = j + 1; k < i; k++) {
                    if(a[k] < a[j]) {
                        if(k - lst > d) {
                            ok = 0;
                        }
                        lst = k;
                    }
                }
                if(i - lst > d) {
                    ok = 0;
                }
                if(ok) {
                    dp[i] = max(dp[j] + 1, dp[i]);
                }
            }
        }
        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;
}