Jamie was very interested in magic recently. Mabel told him that in order to dynamic planning, he must help her solve a problem. There have a pair of two positive integers not exceeding N,(a,b), which she has forgotten. She remembers that the remainder of a divided by b was greater than or equal to K. If Jamie find the number of possible pairs that she may have had, she will help him learn dynamic planning. Now he wants you to help him calculate this problem.

Input contains multiple sets of test data(there are no more than 1000 data sets) .Each input containing 2 integers: N(1≤N≤1e5), K(0≤K≤N-1).

For each input, you should output the number of possible pairs that he may have had.

5 2
10 0

7
100