{-# OPTIONS_GHC -O2 #-}
{-# LANGUAGE BangPatterns, BinaryLiterals, CPP, DerivingStrategies  #-}
{-# LANGUAGE DerivingVia, FlexibleContexts, FlexibleInstances       #-}
{-# LANGUAGE GeneralizedNewtypeDeriving, KindSignatures, LambdaCase #-}
{-# LANGUAGE MagicHash, MultiParamTypeClasses, MultiWayIf           #-}
{-# LANGUAGE NumericUnderscores, OverloadedStrings, PatternSynonyms #-}
{-# LANGUAGE RankNTypes, RecordWildCards, ScopedTypeVariables       #-}
{-# LANGUAGE StandaloneDeriving, TupleSections, TypeApplications    #-}
{-# LANGUAGE TypeFamilies, TypeInType, UnboxedTuples, ViewPatterns  #-}

import           Control.Applicative
import           Control.Exception
import           Control.Monad
import           Control.Monad.Primitive
import           Control.Monad.Reader
import           Control.Monad.ST
import           Control.Monad.State.Strict
import           Data.Bifunctor
import           Data.Bool
import qualified Data.ByteString                   as B
import qualified Data.ByteString.Builder           as B
import qualified Data.ByteString.Char8             as C
import qualified Data.ByteString.Internal          as B
import qualified Data.ByteString.Unsafe            as B
import           Data.Char
import qualified Data.Foldable                     as F
import           Data.Function
import           Data.Functor.Identity
import qualified Data.IntMap.Strict                as IM
import qualified Data.IntSet                       as IS
import qualified Data.List                         as L
import qualified Data.Map.Strict                   as M
import           Data.Monoid hiding (Last(..), First(..))
import           Data.Ord
import           Data.Primitive
import           Data.Proxy
import           Data.Ratio
import           Data.Semigroup
import qualified Data.Set                          as S
import           Data.Tuple
import qualified Data.Vector                       as V
import qualified Data.Vector.Algorithms.Intro      as Intro
import qualified Data.Vector.Fusion.Stream.Monadic as MS
import qualified Data.Vector.Fusion.Bundle.Monadic as MB
import           Data.Vector.Fusion.Util
import qualified Data.Vector.Generic               as G
import qualified Data.Vector.Generic.Mutable       as GM
import qualified Data.Vector.Mutable               as VM
import qualified Data.Vector.Primitive             as P
import qualified Data.Vector.Primitive.Mutable     as PM
import qualified Data.Vector.Unboxed               as U
import qualified Data.Vector.Unboxed.Mutable       as UM
import           Debug.Trace
import           Foreign                           hiding (void)
import           GHC.Exts
import           GHC.TypeLits
import           System.IO
import           Unsafe.Coerce

#define MOD 1000000007

main :: IO ()
main = do
    [n, k] <- map read.words <$> getLine
    xs <- U.unfoldrN n (runParser int) <$> C.getContents
    print $ solve n k xs

solve :: Int -> Int -> U.Vector Int -> Int
solve n k xs = runST $ do
    seg <- buildSegTree @() @(Max Int)
        $ U.replicate 300300 (Max 0)
    U.forM_ xs $ \x -> do
        x' <- getMax <$> mappendFromTo seg (max 0 $ x - k) (min 300300 $ x + k + 1)
        old <- readSegTree seg x
        writeSegTree seg x (old <> Max (x' + 1))
    getMax <$> mappendAll seg

-------------------------------------------------------------------------------
-- Utils
-------------------------------------------------------------------------------
rep :: (Monad m) => Int -> (Int -> m ()) -> m ()
rep n = flip MS.mapM_ (stream 0 n)
{-# INLINE rep #-}
rep1 :: (Monad m) => Int -> (Int -> m ()) -> m ()
rep1 n = flip MS.mapM_ (stream 1 (n + 1))
{-# INLINE rep1 #-}
rev :: (Monad m) => Int -> (Int -> m ()) -> m ()
rev n = flip MS.mapM_ (streamR 0 n)
{-# INLINE rev #-}
rev1 :: (Monad m) => Int -> (Int -> m ()) -> m ()
rev1 n = flip MS.mapM_ (streamR 1 (n + 1))
{-# INLINE rev1 #-}
stream :: (Monad m) => Int -> Int -> MS.Stream m Int
stream !l !r = MS.Stream step l where { step x | x < r = return $ MS.Yield x (x + 1) | otherwise = return MS.Done; {-# INLINE [0] step #-}}
{-# INLINE [1] stream #-}
streamR :: (Monad m) => Int -> Int -> MS.Stream m Int
streamR !l !r = MS.Stream step (r - 1) where { step x | x >= l = return $ MS.Yield x (x - 1) | otherwise = return MS.Done; {-# INLINE [0] step #-}}
{-# INLINE [1] streamR #-}
stream' :: (Monad m) => Int -> Int -> Int -> MS.Stream m Int
stream' !l !r !d = MS.Stream step l where { step x | x < r = return $ MS.Yield x (x + d) | otherwise = return MS.Done; {-# INLINE [0] step #-}}
{-# INLINE [1] stream' #-}
infixl 8 `shiftRL`, `unsafeShiftRL`
shiftRL :: Int -> Int -> Int
shiftRL = unsafeShiftRL
{-# INLINE shiftRL #-}
unsafeShiftRL :: Int -> Int -> Int
unsafeShiftRL (I# x#) (I# i#) = I# (uncheckedIShiftRL# x# i#)
{-# INLINE unsafeShiftRL #-}
type Parser a = StateT C.ByteString Maybe a
runParser :: Parser a -> C.ByteString -> Maybe (a, C.ByteString)
runParser = runStateT
{-# INLINE runParser #-}
int :: Parser Int
int = coerce $ C.readInt . C.dropWhile isSpace
{-# INLINE int #-}
int1 :: Parser Int
int1 = fmap (subtract 1) int
{-# INLINE int1 #-}
char :: Parser Char
char = coerce C.uncons
{-# INLINE char #-}
byte :: Parser Word8
byte = coerce B.uncons
{-# INLINE byte #-}
skipSpaces :: Parser ()
skipSpaces = modify' (C.dropWhile isSpace)
{-# INLINE skipSpaces #-}
binarySearchM :: (Monad m) => Int -> Int -> (Int -> m Bool) -> m Int
binarySearchM low high p = go low high where { go !low !high | high <= low = return high | otherwise = p mid >>= bool (go (mid + 1) high) (go low mid) where { mid = low + unsafeShiftRL (high - low) 1}}
{-# INLINE binarySearchM #-}
binarySearch :: Int -> Int -> (Int -> Bool) -> Int
binarySearch low high p = runIdentity (binarySearchM low high (return . p))
{-# INLINE binarySearch #-}
radixSort :: U.Vector Int -> U.Vector Int
radixSort v = F.foldl' step v [0, 16, 32, 48] where { mask k x = unsafeShiftRL x k .&. 65535; step v k = U.create $ do { pos <- UM.unsafeNew 65537; UM.set pos 0; U.forM_ v $ \ x -> do { UM.unsafeModify pos (+ 1) (mask k x + 1)}; rep 65535 $ \ i -> do { fi <- UM.unsafeRead pos i; UM.unsafeModify pos (+ fi) (i + 1)}; res <- UM.unsafeNew $ U.length v; U.forM_ v $ \ x -> do { let { !masked = mask k x}; i <- UM.unsafeRead pos masked; UM.unsafeWrite pos masked $ i + 1; UM.unsafeWrite res i x}; return res}}
{-# INLINE radixSort #-}
encode32x2 :: Int -> Int -> Int
encode32x2 x y = unsafeShiftL x 32 .|. y
{-# INLINE encode32x2 #-}
decode32x2 :: Int -> (Int, Int)
decode32x2 xy = let { !x = unsafeShiftRL xy 32; !y = xy .&. 4294967295} in (x, y)
{-# INLINE decode32x2 #-}
-------------------------------------------------------------------------------
-- Data.SegTree
-------------------------------------------------------------------------------
class (Monoid f) => MonoidAction f a where { appMonoid :: f -> a -> a}
instance MonoidAction () m where { appMonoid = flip const; {-# INLINE appMonoid #-}}
instance MonoidAction (Sum Int) (Min Int) where { appMonoid (Sum x) (Min y) | y /= maxBound = Min (x + y) | otherwise = Min y; {-# INLINE appMonoid #-}}
instance MonoidAction (Sum Int) (Max Int) where { appMonoid (Sum x) (Max y) | y /= minBound = Max (x + y) | otherwise = Max y; {-# INLINE appMonoid #-}}
instance MonoidAction (Sum Int) (Sum Int, Sum Int) where { appMonoid (Sum x) (Sum y, Sum size) = (Sum (y + x * size), Sum size)}
instance MonoidAction (Dual (Maybe (Last (Min Int)))) (Min Int) where { appMonoid (Dual Nothing) y = y; appMonoid (Dual (Just x)) _ = coerce x}
instance MonoidAction (Dual (Maybe (Last (Max Int)))) (Max Int) where { appMonoid (Dual Nothing) y = y; appMonoid (Dual (Just x)) _ = coerce x}
instance MonoidAction (Min Int) (Min Int) where { appMonoid = (<>); {-# INLINE appMonoid #-}}
instance MonoidAction (Max Int) (Max Int) where { appMonoid = (<>); {-# INLINE appMonoid #-}}
data SegTree s f a = SegTree{getSegTree :: !(UM.MVector s a), getDualSegTree :: !(UM.MVector s f), sizeSegTree :: !Int, heightSegTree :: !Int}
newSegTree :: (Monoid f, U.Unbox f, Monoid a, U.Unbox a, PrimMonad m) => Int -> m (SegTree (PrimState m) f a)
newSegTree n0 = do { seg <- UM.replicate (2 * n) mempty; dseg <- UM.replicate n mempty; return $ SegTree seg dseg n (63 - countLeadingZeros n)} where { !n = extendToPowerOfTwo n0}
buildSegTree :: (Monoid f, U.Unbox f, Monoid a, U.Unbox a, PrimMonad m) => U.Vector a -> m (SegTree (PrimState m) f a)
buildSegTree xs = do { seg <- UM.replicate (2 * n) mempty; dseg <- UM.replicate n mempty; U.unsafeCopy (UM.unsafeSlice n (U.length xs) seg) xs; let { st = SegTree seg dseg n (63 - countLeadingZeros n)}; rev1 (n - 1) $ \ i -> do { pullSegTree st i}; return st} where { !n = extendToPowerOfTwo $ U.length xs}
readSegTree :: (MonoidAction f a, U.Unbox f, U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> Int -> m a
readSegTree st k0 = do { let { !k = k0 + sizeSegTree st}; rev1 (heightSegTree st) $ \ i -> do { pushSegTree st (unsafeShiftR k i)}; UM.unsafeRead (getSegTree st) k}
{-# INLINE readSegTree #-}
writeSegTree :: (MonoidAction f a, Semigroup a, U.Unbox a, U.Unbox f, PrimMonad m) => SegTree (PrimState m) f a -> Int -> a -> m ()
writeSegTree st k0 v = do { let { !k = k0 + sizeSegTree st}; rev1 (heightSegTree st) $ \ i -> do { pushSegTree st (unsafeShiftR k i)}; UM.unsafeWrite (getSegTree st) k v; rep1 (heightSegTree st) $ \ i -> do { pullSegTree st (unsafeShiftR k i)}}
{-# INLINE writeSegTree #-}
modifySegTree :: (MonoidAction f a, Semigroup a, U.Unbox f, U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> (a -> a) -> Int -> m ()
modifySegTree st f k0 = do { let { !k = k0 + sizeSegTree st}; rev1 (heightSegTree st) $ \ i -> do { pushSegTree st (unsafeShiftR k i)}; UM.unsafeModify (getSegTree st) f k; rep1 (heightSegTree st) $ \ i -> do { pullSegTree st (unsafeShiftR k i)}}
{-# INLINE modifySegTree #-}
mappendFromTo :: (MonoidAction f a, Monoid a, U.Unbox f, U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> Int -> Int -> m a
mappendFromTo st l0 r0 = do { let { !l = l0 + sizeSegTree st; !r = r0 + sizeSegTree st}; rev1 (heightSegTree st) $ \ i -> do { when (unsafeShiftR l i `unsafeShiftL` i /= l) $ do { pushSegTree st (unsafeShiftR l i)}; when (unsafeShiftR r i `unsafeShiftL` i /= r) $ do { pushSegTree st (unsafeShiftR r i)}}; fix (\ loop !accL !accR !l' !r' -> do { if l' < r' then do { !accL' <- if l' .&. 1 == 1 then (accL <>) <$!> UM.unsafeRead (getSegTree st) l' else return accL; !accR' <- if r' .&. 1 == 1 then (<> accR) <$!> UM.unsafeRead (getSegTree st) (r' - 1) else return accR; loop accL' accR' (unsafeShiftR (l' + l' .&. 1) 1) (unsafeShiftR (r' - r' .&. 1) 1)} else return $! accL <> accR}) mempty mempty l r}
{-# INLINE mappendFromTo #-}
mappendAll :: (U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> m a
mappendAll st = UM.unsafeRead (getSegTree st) 1
{-# INLINE mappendAll #-}
appAt :: (MonoidAction f a, Semigroup a, U.Unbox f, U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> Int -> f -> m ()
appAt st k f = modifySegTree st (appMonoid f) k
{-# INLINE appAt #-}
appFromTo :: (MonoidAction f a, Semigroup a, U.Unbox f, U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> Int -> Int -> f -> m ()
appFromTo st l0 r0 f = when (l0 < r0) $ do { let { !l = l0 + sizeSegTree st; !r = r0 + sizeSegTree st}; rev1 (heightSegTree st) $ \ i -> do { when (unsafeShiftR l i `unsafeShiftL` i /= l) $ do { pushSegTree st (unsafeShiftRL l i)}; when (unsafeShiftR r i `unsafeShiftL` i /= r) $ do { pushSegTree st (unsafeShiftRL (r - 1) i)}}; fix (\ loop !l' !r' -> when (l' < r') $ do { when (l' .&. 1 == 1) $ do { evalAt st l' f}; when (r' .&. 1 == 1) $ do { evalAt st (r' - 1) f}; loop (unsafeShiftR (l' + l' .&. 1) 1) (unsafeShiftR (r' - r' .&. 1) 1)}) l r; rep1 (heightSegTree st) $ \ i -> do { when (unsafeShiftR l i `unsafeShiftL` i /= l) $ do { pullSegTree st (unsafeShiftRL l i)}; when (unsafeShiftR r i `unsafeShiftL` i /= r) $ do { pullSegTree st (unsafeShiftRL (r - 1) i)}}}
{-# INLINE appFromTo #-}
evalAt :: (MonoidAction f a, U.Unbox f, U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> Int -> f -> m ()
evalAt st k f = do { tk <- UM.unsafeModify (getSegTree st) (appMonoid f) k; when (k < sizeSegTree st) $ do { UM.unsafeModify (getDualSegTree st) (f <>) k}}
{-# INLINE evalAt #-}
pushSegTree :: (MonoidAction f a, U.Unbox f, U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> Int -> m ()
pushSegTree st k = do { fk <- UM.unsafeRead (getDualSegTree st) k; UM.unsafeWrite (getDualSegTree st) k mempty; evalAt st (2 * k) fk; evalAt st (2 * k + 1) fk}
{-# INLINE pushSegTree #-}
pullSegTree :: (Semigroup a, U.Unbox a, PrimMonad m) => SegTree (PrimState m) f a -> Int -> m ()
pullSegTree st k = do { (<>) <$> UM.unsafeRead (getSegTree st) (2 * k) <*> UM.unsafeRead (getSegTree st) (2 * k + 1) >>= UM.unsafeWrite (getSegTree st) k}
{-# INLINE pullSegTree #-}
extendToPowerOfTwo :: Int -> Int
extendToPowerOfTwo x | x > 1 = unsafeShiftRL (-1) (countLeadingZeros (x - 1)) + 1 | otherwise = 1


Measured memory_bytes: 19860