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: N,K = map(int, input().split())
  res = 0
  if K==0:
      print(N*N)
      return
  for i in range(N):
      i += 1
      if i-K<=0:
          continue
      amari = N % i
      amari = amari - K + 1
      re = N//i
      if amari<=0:
          amari = 0
      res += re*(i-K) + amari
   print(res)
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"}]