#include<bits/stdc++.h>
#define ll long long
using namespace std;
int f[3000010];
ll gcd(ll a,ll b){
	if(a<b) swap(a,b);
	return a%b==0?b:gcd(b,a%b);
}
int main(){
	ll x,n;
	scanf("%lld%lld",&x,&n);
	if(x==1){	
	for(int i=1;i<=n;i++){
		ll l,r;
		scanf("%lld%lld",&l,&r);
	printf("%lld\n",r-l+1);
		
	}
		
	}
	else{
	int i;
	for(i=0;i<=32;i++){
		if((1<<i)>x) break;
	}
	int num=1<<i;
//	printf("%d\n",num);
	for(i=1;i<=num;i++){
		if((i*x)==x){
			f[i]=f[i-1];
			continue;
		}
		if(gcd((i*x)^x,x)==1){
			f[i]=f[i-1]+1;
		}
		else f[i]=f[i-1];
//		printf("   %lld %lld\n",i,f[i]);
	}
	for(int i=1;i<=n;i++){
		ll l,r;
		scanf("%lld%lld",&l,&r);
	printf("%lld\n",f[num]*(r/num)+f[r%num]-f[num]*((l-1)/num)-f[(l-1)%num]);
		
	}
		
	}
	return 0;
}