#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second

int gcd(int a,int b){
	return b ? gcd(b,a % b) : a;
}

void solve(){
	int x,n;
	cin >>x>>n;

	int pre = -1; 
	int zz;
	for(int i = 1;i <= 1e8;i ++){
		int z = (i * x) ^ x;
		int z1 = gcd(z,x);
		if(z1 == x){
			if(pre == i - 1){
				zz = i - 1;
				break;
			}
			pre = i;
		}
	}
	vector<int> s(zz + 1);
	for(int i = 1;i <= zz;i ++){
		int z = (i * x) ^ x;
		int z1 = gcd(z,x);
		if(z1 == 1){
			s[i] = s[i - 1] + 1;
		}
		else s[i] = s[i - 1];
	}
	for(int i=0;i<zz;i++) s[i] = s[i+1];
	int t = zz;
	for(int i = 1;i <= n;i ++){
		int l,r;
		cin >>l>>r;
		l--,r--;
		int sum = 0;
		int L = l/t + 1;
		int R = r/t;
		int ll = 0;
		if(l%t==0) ll = 0;
		else ll = s[l%t];
		if(L>R){
			sum = s[r%t] - ll;
		}else{
			sum = (R-L) * s[t-1] + s[t-1] - ll + s[r%t];
		}
		cout<<sum<<'\n';
	}
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T;
	T = 1;
	while(T --){
		solve();
	}
}