output_description: Print the number of possible pairs that he may have had.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: from math import (
      ceil,
      floor,
      factorial,
      gcd,
      sqrt,
      log2,
      cos,
      sin,
      tan,
      acos,
      asin,
      atan,
      degrees,
      radians,
      pi,
      inf,
      comb,
  )
  from itertools import (
      accumulate,
      groupby,
      permutations,
      combinations,
      product,
      combinations_with_replacement,
  )
  from collections import deque, defaultdict, Counter
  from bisect import bisect_left, bisect_right
  from operator import itemgetter
  from heapq import heapify, heappop, heappush
  from queue import Queue, LifoQueue, PriorityQueue
  from copy import deepcopy
  from time import time
  from functools import reduce
  import string
  import sys
  
  sys.setrecursionlimit(10**7)
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def INT():
      return int(input())
  
  
  def MAP():
      return map(int, input().split())
  
  
  def LIST():
      return list(MAP())
  
  
  n, k = MAP()
  ans = 0
  if k == 0:
      ans = n**2
  else:
      for b in range(k + 1, n + 1):
          x = n // b
          y = n % b
          ans += (b - k) * x + (y - k + 1 if y >= k else 0)
  print(ans)
  
problem_description: Statement
  
  Takahashi had a pair of two positive integers not exceeding N, (a,b), which he
  has forgotten. He remembers that the remainder of a divided by b was greater
  than or equal to K. Find the number of possible pairs that he may have had.
samples: [{"input": "5 2", "output": "7\n    \n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\n* * *"}, {"input": "10 0", "output": "100\n    \n\n* * *"}, {"input": "31415 9265", "output": "287927211"}]