#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int op(int a, int b) { return a + b; }
int e() { return 0; }
int target;
bool f(int v) { return v < target; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long p; cin >> p;
	int q; cin >> q;
	vector<int>v;
	vector<long long>s, ss;
	int x = 1;
	while (x <= p) {
		long long y = p / x;
		int r = p / y;
		//cout << x << " " << r << endl;
		v.push_back(r - x + 1);
		long long val = y * (x + r)*(r - x + 1) / 2;
		s.push_back(val);
		x = r + 1;
	}
	v.push_back(INF);
	s.push_back(INF);
	ss.resize(s.size() + 1);
	rep(i, s.size())ss[i + 1] = s[i] + ss[i];
	segtree<int, op, e>seg(v);
	auto calc = [&](long long r)->long long {
		if (0 == r)return 0;
		target = r;
		auto pos = seg.max_right<f>(0);
		long long ret = ss[pos];
		long long l = seg.prod(0, pos) + 1;
		ret += (p / l) * (l + r) *(r - l + 1) / 2;
		return ret;
	};
	while (q--) {
		int l, r; cin >> l >> r;l--;
		long long ans = (long long)p * (r - l);
		ans -= calc(r) - calc(l);
		cout << ans << endl;
	}
	return 0;
}