import math

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    P = int(input[ptr])
    ptr += 1
    Q = int(input[ptr])
    ptr += 1
    queries = []
    for _ in range(Q):
        L = int(input[ptr])
        ptr += 1
        R = int(input[ptr])
        ptr += 1
        queries.append((L, R))
    
    sqrtP = int(math.isqrt(P))
    for L, R in queries:
        L_prime = max(L, 1)
        R_prime = min(R, P)
        if L_prime > R_prime:
            print(0)
            continue
        
        total = P * (R - L + 1)
        sum_n_floor = 0
        
        lower = max(L_prime, 1)
        upper = min(R_prime, sqrtP)
        if lower <= upper:
            for n in range(lower, upper + 1):
                sum_n_floor += n * (P // n)
        
        max_k = sqrtP
        for k in range(1, max_k + 1):
            n_min = (P // (k + 1)) + 1
            n_max = P // k
            a = max(n_min, L_prime)
            b = min(n_max, R_prime)
            a = max(a, sqrtP + 1)
            if a > b:
                continue
            sum_n_floor += k * (a + b) * (b - a + 1) // 2
        
        total -= sum_n_floor
        print(total)

if __name__ == "__main__":
    main()