#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
long double PI = acos(-1);

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


ll sum[10000001];
ll P, Q;

ll solve(ll x) {
	ll res = P * x;
	if (x <= 10000000) res -= sum[x];
	else {
		res -= sum[10000000];
		for (ll i = 1;; i++) {
			ll lf = min(P / (i + 1) + 1, 10000001LL);
			ll rg = max(P / i, x);
			if (lf > rg) continue;
			if (rg <= 10000000) break;
			res -= i * (lf + rg) * (rg - lf + 1) / 2;
		}
	}
	return res;
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	scanf("%lld %lld", &P, &Q);
	for (ll i = 1; i <= 10000000; i++) {
		sum[i] = sum[i - 1];
		sum[i] += P / i * i;
	}
	while (Q--) {
		ll l, r; scanf("%lld %lld", &l, &r);
		l--;
		ll res = solve(r);
		if (l) res -= solve(l);
		printf("%lld\n", res);
	}
	return 0;

}