from sys import stdin
def input(): return stdin.readline()[:-1]

B = int(1e6)
p, q = map(int, input().split())

rem = [0] + [p%i for i in range(1, B+1)]
for i in range(1, B + 1):
    rem[i] += rem[i - 1]
quo = [0] * (B + 1)
for i in range(B + 1):
    quo[i] = (p//(i + 1)) + 1

for _ in range(q):
    l, r = map(int, input().split())
    res = rem[min(r, B)] - rem[min(l - 1, B)]
    l = max(l, B + 1)
    if l <= r:
        s, e = p//l, p//r
        for t in range(s, e, -1):
            right = quo[t - 1] - 1
            res += p * (right - l + 1)
            res -= (t * (right - l + 1) * (right + l)) // 2
            l = quo[t - 1]
        res += p * (r - l + 1)
        res -= (e * (r - l + 1) * (l + r)) // 2
    print(res)