#include<iostream>
using namespace std;
long p,q,r;
long sum[1<<17];
long cnt[1<<17];
long f(int x)
{
	long ans=sum[x>r?r:x];
	if(x<=r)return ans;
	if(x>=p)return ans+cnt[1]+(x-p)*p;
	int i=(p-1)/x;
	long j=p/i;
	ans+=cnt[i];
	ans-=(j-x)*(j-x-1)/2*i+(j-x)*(p%j);
	return ans;
}
main()
{
	cin>>p>>q;
	for(int i=1;i*i<=p;r=i++)sum[i]=sum[i-1]+p%i;
	for(int i=r;i>0;i--)
	{
		long j=p/i;
		long next=i==r?r:p/(i+1);
		cnt[i]=(j-next)*(j-next-1)/2*i+(j-next)*(p%j)+cnt[i+1];
	}
	for(int i=0;i<q;i++)
	{
		int l,r;cin>>l>>r;
		cout<<f(r)-f(l-1)<<endl;
	}
}