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())
  
  
  ans = 0
  
  # N = pb + r
  
  for b in range(k+1,n+1):
      p = n//b
      r = n%b
      ans += p * max(0,b-k) + max(0, r-k+1)
  
  
  if k==0:
      ans -= n
  
  print(
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"}]