#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;
	for(int i = 2;i <= x + 10;i ++){
		int z = (i * x) ^ x;
		int z1 = gcd(z,x);
		if(z1 == x){
			x = i - 1;
			break;
		}
	}
	vector<int> s(x + 2);
	for(int i = 1;i <= x + 1;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 = 1;i <= n;i ++){
		int l,r;
		cin >>l>>r;
		int sum = 0;
		if(l == r){
			l = (l % (x + 1));
			if(l == 0)cout<<s[(x + 1)] - s[x]<<'\n';
			else cout<<s[l] - s[l - 1]<<'\n';
			continue;
		}
		if(l % (x + 1) == 0){
			l ++;
			sum += s[x + 1] - s[x];
		}
		if(r <= l + ((x + 1) - (l % (x + 1)))){
			if(r % (x + 1) != 0)cout<<s[r % (x + 1)] - s[(l % (x + 1)) - 1]<<'\n';
			else cout<<s[x + 1] - s[(l % (x + 1)) - 1]<<'\n';
			continue;
		}
		int z = l % (x + 1);
		int z1 = r % (x + 1);
		r -= r % (x + 1);
		l += ((x + 1) - (l % (x + 1)));
		sum = ((r - l) / (x + 1)) * s[x + 1];
		sum += s[(x + 1)] - s[z - 1];
		sum += s[z1] - s[0];
		cout<<sum<<'\n';
	}
}

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