#include <iostream>

using namespace std;

typedef long long LL;

int p, q, l, r;
LL ans;

int main() {
    // freopen("mod.in", "r", stdin);
    // freopen("mod.out", "w", stdout);

    scanf("%d%d", &p, &q);
    while (q--) {
        scanf("%d%d", &l, &r);
        ans = 0LL;
        if (r > p) {
            if (l > p) {
                ans = 1LL * p * (r - l + 1);
                printf("%lld\n", ans);
                continue;
            } else {
                ans += 1LL * p * (r - p);
                r = p;
            }
        }
        int cr = r;
        while (true) {
            bool flag = false;
            int x = p / cr;
            int v1 = p % cr;
            int cl = (p + x) / (x + 1);
            int v2 = p % cl;
            if (cl == 1) break;
            if (v2 == 0) {
                ++cl;
                v2 = p % cl;
                flag = true;
            }
            if (cl > l) {
                ans += 1LL * (v1 + v2) * (cr - cl + 1) / 2;
                cr = cl - 1;
                if (flag) --cr;
            } else {
                cl = l;
                v2 = p % cl;
                ans += 1LL * (v1 + v2) * (cr - cl + 1) / 2;
                break;
            }
        }
        printf("%lld\n", ans);
    }

    return 0;
}