#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


int main() {
  ll p, q;
  cin >> p >> q;
  const int N = 1000000;
  vl a(N);
  rep1 (i, N) {
    a[i - 1] = p % i;
  }
  vl sum(N + 1);
  rep (i, N) {
    sum[i + 1] = sum[i] + a[i];
  }
  ll ma = p / (N + 1);
  vector<pll> num(ma + 1);
  ll pre = N;
  for (int i = ma; i >= 0; i--) {
    num[i].first = pre + 1;
    if (i == 0) {
      num[i].second = INF;
    }
    else {
      num[i].second = p / i;
      while (p / num[i].second < i) {
        num[i].second--;
      }
      while (p / num[i].second > i) {
        num[i].second++;
      }
    }
    pre = num[i].second;
  }
  //DEBUG_VEC(num);
  rep (i, q) {
    ll l, r;
    cin >> l >> r;
    ll res = 0;
    if (r <= N) {
      res = sum[r] - sum[l - 1];
      cout << res << endl;
      continue;
    }
    if (l <= N) {
      res = sum[N] - sum[l - 1];
      l = N + 1;
    }
    //DEBUG(res);
    rep (j, num.size()) {
      ll l2 = max(l, num[j].first), r2 = min(r, num[j].second);
      if (l2 > r2) {
        continue;
      }
      //DEBUG(l2); DEBUG(r2);
      ll s = p % l2;
      ll m = r2 - l2 + 1;
      res += s * m - j * (m - 1) * m / 2;
      //DEBUG(res);
    }
    cout << res << endl;
  }
}