N, K = map(int, input().split())
A = [[-1] for i in range(300010)]
d = [0] * N
for i in range(N):
    d[i] = int(input())
    A[d[i]].append(i)

c = [[0] * 2 for i in range(N)]

def segfunc(x, y):
    return max(x, y)
#################

#####ide_ele#####
ide_ele = -float("INF")
#################

a = [0] * 300010
for i in range(300001):
    a[i] = A[i][-1]

class SegTree:
    """
    init(init_val, ide_ele): 配列init_valで初期化 O(N)
    update(k, x): k番目の値をxに更新 O(logN)
    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
    """
    def __init__(self, init_val, segfunc, ide_ele):
        """
        init_val: 配列の初期値
        segfunc: 区間にしたい操作
        ide_ele: 単位元
        n: 要素数
        num: n以上の最小の2のべき乗
        tree: セグメント木(1-index)
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新
        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る
        l: index(0-index)
        r: index(0-index)
        """
        res = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res

seg = SegTree(a, segfunc, ide_ele)

for i in range(N-1, -1, -1):
    del A[d[i]][-1]
    seg.update(d[i] ,A[d[i]][-1])
    s = min(d[i] + K + 1, 300001)
    t = max(d[i] - K, 1)
    c[i][0] = seg.query(d[i], s)
    c[i][1] = seg.query(t, d[i]+1)
    #print(A[:10])


dp = [1] * (N + 2)
ans = 0
for i in range(N-1, -1, -1):
    dp[c[i][0]] = dp[i] + 1
    dp[c[i][1]] = dp[i] + 1
    ans = max(ans, dp[i])

print(ans)