#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr int MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os; }
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}

// \sum_{n = L_i ^ R_i} P - [P / n] * n
// (R_i - L_i * 1) * P - \sum_{n = L_i ^ R_i} [P / n] * n
set<ll> D;
set<ll>::iterator it;

ll solve(ll P, ll l, ll r) {

    ll ans = (r - l + 1) * P;
    for(; it != D.end(); it++) {
        ll ll, rr;
        int d = *it;
        d *= -1;

        int ng = P + 1;
        int ok = 0;
        while(ng - ok > 1) {
            int c = (ok + ng) / 2;
            if (P / c >= d) {
                ok = c;
            } else {
                ng = c;
            }
        }
        rr = ok;

        ng = P + 1;
        ok = 0;
        while(ng - ok > 1) {
            int c = (ok + ng) / 2;
            if (P / c > d) {
                ok = c;
            } else {
                ng = c;
            }
        }
        ll = ng;

        if (ll > r) break;
        ll = max(l, ll);
        rr = min(r, rr);
        if (ll > rr) continue;

        ans -= d * (ll + rr) * (rr - ll + 1) / 2;
    }
    if (it != D.begin()) it--;
    return ans;
}

ll solveNaive(int P, int l, int r) {
    ll ret = 0;
    for(int i = l; i <= r; i++) {
        ret += P % i;
    }
    return ret;
}

void solve() {
    ll P, Q;
    cin >> P >> Q;

    for(ll n = 1; n * n <= P; n++) {
        D.insert(-n);
        D.insert(-(P / n));
    }
    it = D.begin();

    int d = (int)sqrt(P);
    vector<ll> B((P + 1 + d - 1) / d);
    for (int i = 0; i < B.size(); i++) {
        int l = i * d;
        int r = (i + 1) * d - 1;
        B[i] = solve(P, max(1, l), r);
    }

    for (int q = 0; q < Q; q++) {
        ll l, r;
        cin >> l >> r;
        ll ans = 0;
        if (r > P) {
            ans += (r - P) * P;
            r = P;
        }

        if (r - l < 2 * d) {
            cout << solveNaive(P, l, r) << endl;
            continue;
        }
        
        for(; l % d != 0; l++) {
            ans += P % l;
        }
        for(; r % d != 0; r--) {
            ans += P % r;
        }
        ans += P % r;


        for(int b = l / d; b < r / d; b++) {
            ans += B[b];
        }
        cout << ans << endl;
    }
    
}

int main() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    solve();
    return 0;
}