#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll p, m;
ll ss[33000];
ll sl[33000];
ll solve(ll x){
	if(x==0) return 0;
	if(x<=p/(m+1)) return ss[x];
	ll ans=ss[p/(m+1)];
	ll k=p/x;
	ans+=sl[k+1];
	ans+=(p*x-k*x*(x+1)/2);
	ans-=(p*(p/(k+1))-k*(p/(k+1))*(p/(k+1)+1)/2);
	return ans;
}
int main()
{
	cin>>p;
	m=(ll)sqrt((double)p);
	for(ll i=1; i<=p/(m+1); i++){
		ss[i]=ss[i-1]+(p%i);
	}
	for(ll i=m; i>=1; i--){
		ll s=p*(p/i-p/(i+1))-i*(p/i)*(p/i+1)/2+i*(p/(i+1))*(p/(i+1)+1)/2;
		sl[i]=sl[i+1]+s;
	}
	int q; cin>>q;
	for(int i=0; i<q; i++){
		ll l, r; cin>>l>>r;
		cout<<solve(r)-solve(l-1)<<endl;
	}
	return 0;
}