def solve(p, r):
    ans = 0
    if r * r < p:
        for i in range(1, r + 1):
            ans = ans + p % i
        return ans
    if r > p:
        ans = (r - p) * p
    i = int(p / r)
    if i == 0:
        i = 1
        r = p
    s = p % r
    n = r - int(p / (i + 1))
    ans = ans + int((2 * s + i * (n - 1)) * n / 2)
    i = i + 1
    while i * i <= p:
        s = p % int(p / i)
        n = int(p / i) - int(p/ (i + 1))
        ans = ans + int((2 * s + i * (n - 1)) * n / 2)
        i = i + 1
    for i in range(1, p):
        if i * i >= p:
            break
        ans = ans + p % i
    return ans

P, Q = map(int, input().split())
for i in range(Q):
    L, R = map(int, input().split())
    print(solve(P, R) - solve(P, L - 1))