import Debug.Trace

main :: IO ()
main = do
    [n, k] <- (map read . words) <$> getLine
    print $ solv n k


solv :: Int -> Int -> Int
solv n k = noOfPairs n k

allPairs :: Int -> Int -> [(Int, Int)]
allPairs n k = do
    b <- [k+1..n]
    c <- [0..b-k-1]
    q <- [0..(n-k-c) `div` b]
    let a = b*q + k + c
    if a >= 1 then return (a,b) else []

noOfPairs :: Int -> Int -> Int
noOfPairs n k = sum $ do
    b <- [k+1..n]
    c <- [0..b-k-1]
    return $ (n-c-k) `div` b + 1

-- あるbに対して，あるcに対して，(100-c-k) `div` b + 1が(b, c)から求まる
-- (a,b)の組の数
