use proconio::input;
use num::Num;
use std::cmp;

fn main() {
    input! {
        n: usize,
        k: usize,
        a: [usize; n],
    }

    let max_n = 300_001;
    let mut bit = BIT::new(max_n);

    for &na in &a {
        bit.add(na, 1);
    }

    let mut max = 0;
    for &na in &a {
       let right = cmp::min(na + 2*k,max_n);
       let t = bit.sum(na as isize, right as isize);
       max = cmp::max(t, max);
    }

    println!("{}", max);
}


struct BIT<T> {
    pub n: usize,
    pub d: Vec<T>,
}

impl<T> BIT<T>
where
    T: Num + Copy + Clone,
{
    fn new(n: usize) -> Self {
        BIT {
            n: n,
            d: vec![T::zero(); n + 1],
        }
    }

    fn add(&mut self, mut i: usize, x: T) {
        i += 1;
        while i <= self.n {
            self.d[i] = self.d[i] + x;
            i += i & i.wrapping_neg();
        }
    }

    //多分[0, i]の和を求める
    fn sum_one(&self, mut _i: isize) -> T {
        let mut x = T::zero();
        _i += 1;
        let mut i = _i as usize;
        while i != 0 {
            x = x + self.d[i];
            i -= i & i.wrapping_neg();
        }
        x
    }

    // [l, r)の和を求める(rは含まない)
    fn sum(&self, l: isize, r: isize) -> T {
        self.sum_one(r - 1) - self.sum_one(l - 1)
    }
}
