// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

const int K = 10000000;
int sum[K+10];

signed main() {
    int P, Q; cin >> P >> Q;
    for(int i=1; i<=K; i++) {
        int mod = P % i;
        sum[i] = sum[i-1] + mod;
    }
    
    while(Q--) {
        if(Q % 10000 == 0) {
            fprintf(stderr, "Q = %lld\n", Q);
        }
        int l, r; cin >> l >> r;
        int ans = 0;
        if(r <= K) {
            ans = sum[r] - sum[l-1];
            cout << ans << endl;
            continue;
        }
        else if(l <= K and K <= r) {
            ans = sum[K] - sum[l-1];
            l = K+1;
        }
        int vl = P / l, vr = P / r, cur = l;

        int cnt = 0;
        for(int div=vl; div>=vr; div--) {
            cnt++;
            if(div == 0) {
                int ll = max(l, P + 1);
                int rr = r;
                int add = 2 * P * (rr - ll + 1) / 2;
                ans += add;
            }
            else {
                int ll = max(P / (div + 1) + 1, l);
                int rr = min(P / div, r);
                
                int lll = P % ll, rrr = P % rr;
                int add = (lll + rrr) * (rr - ll + 1) / 2;
                ans += add;
                if(P / cur != P / (cur + 1)) {
                    cur++;
                    div = P / cur + 1;
                }
            }
        }
        // fprintf(stderr, "div cnt = %lld\n", cnt);
        cout << ans << endl;
    }
    return 0;
}