#include <iostream>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

const int N = 100010;

int p, q;
LL ans[N];
PII pp[N];

// 可以把l, r排序？
// i超过p的模p都是p

int main() {
    // freopen("mod.in", "r", stdin);
    // freopen("mod.out", "w", stdout);
    
    scanf("%d%d", &p, &q);
    for (int i = 1; i <= q; ++i) {
        scanf("%d%d", &pp[i].first, &pp[i].second);
    }

    for (int i = 1; i <= q; ++i) {
        ans[i] += 1LL * p * max(0, pp[i].second - p);
        for (int j = pp[i].first; j <= min(p, pp[i].second); ++j) {
            ans[i] += p % j;
        }
        printf("%lld\n", ans[i]);
    }

    return 0;
}