//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head

int p, q, m, u;
map<int, ll> mp;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> p >> q;
	m = sqrt(p);
	u = p/m;
	for(int i = 1; i <= u; i++) {
		mp[i] = mp[i-1] + p%i;
	}
	for(int j = m-1; j > 0; j--) {
		auto x = *mp.rbegin();
		int y = p/j;
		mp[y] = x.second + (ll)(y-x.first)*(p%y + p%(x.first+1))/2;
	}

	while(q--) {
		int lr[2];
		cin >> lr[0] >> lr[1];
		lr[0]--;
		ll box[2];
		rep(u, 2) {
			map<int, ll>::iterator lb = mp.lower_bound(lr[u]);
			if(lb->first == lr[u]) box[u] = lb->second;
			else {
				lb = prev(lb);
				box[u] = lb->second + (ll)(lr[u]-lb->first)*(p%lr[u] + p%(lb->first+1))/2;
			}
		}
		cout << box[1] - box[0] << '\n';
	}
}