#include <bits/stdc++.h>

using namespace std;

using ll = long long;

ll sum1[100000], sum2[100000];

ll solve(int L, int R, int p, int sz) {
    if (L > p) {
        return (ll)p * (R - L + 1);
    }

    if (R <= sz) {
        return sum1[R] - sum1[L - 1];
    }

    ll res = 0;
    if (R > p) {
        res += (ll)p * (R - p);
        R = p;
    }

    if (L <= sz) {
        res += sum1[sz] - sum1[L - 1];
        L = sz + 1;
    }

    // L > sz && R <= p
    int bL = p / L;
    int bR = p / R;

    // bL >= bR
    if (bL == bR) {
        res += (ll)(p % L + p % R) * (R - L + 1) / 2;
        return res;
    }

    int hoge = p / bL;
    res += (ll)(p % L + p % hoge) * (hoge - L + 1) / 2;

    int foo = p / bR;
    res += sum2[bR] - sum2[bR - 1] - (ll)(p % R + p % foo) * (foo - R + 1) / 2 + p % R;

    bL--;
    bR++;

    if (bL < bR) return res;
    // bL >= bR
    res += sum2[bL] - sum2[bR - 1];
    return res;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int p;
    int q;
    cin >> p >> q;

    int sz = 1;
    while (sz * sz < p) {
        int nsz = sz + 1;
        if (nsz * nsz > p) break;
        sz = nsz;
    }

    for (int i = 2; i <= sz; i++) {
        sum1[i] = p % i;
    }

    for (int i = 1; i <= sz; i++) {
        sum1[i] += sum1[i - 1];
    }

    for (int i = 1; i <= sz; i++) {
        int last = p / i;
        int first = p / (i + 1) + 1;
        int minv = p % last;
        int maxv = p % first;
        sum2[i] = (ll)(maxv + minv) * (last - first + 1) / 2;
    }

    for (int i = 1; i <= sz; i++) {
        sum2[i] += sum2[i - 1];
    }

    for (int i = 0; i < q; i++) {
        int L, R;
        cin >> L >> R;
        cout << solve(L, R, p, sz) << endl;
    }
    return 0;
}