#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = l; i < r; i++)
#define hrp(i, l, r) for(int i = l; i <= r; i++)
#define rev(i, r, l) for(int i = r; i >= l; i--)
#define int ll
using namespace std;
typedef long long ll;
template<typename tn = int> tn next(void) { tn k; cin>>k; return k; }
#ifndef LOCAL
#define D(...) 0
#define I(...) 0
#endif
const int U = 1e6+10;
vector<bool> v;
vector<int> sum{0};
signed main(void)
{
    #ifdef LOCAL
//	freopen("C:\\Users\\Loxil\\Desktop\\IN.txt", "r", stdin);
//	freopen("C:\\Users\\Loxil\\Desktop\\OUT.txt", "w", stdout);
    #endif
    
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int x, n;
    cin>>x>>n;

    int t = 0;
    rep(i, 2, 1e7)
    {
        v.push_back(__gcd((i*x)^x, x) == 1);
        if (t)
        {
            if (v[i-2-t] != v[i-2]) t = 0;
            else if (v.size() == 2*t) break;
        }
        if (!t && v.back() == v[0]) t = i-2;
    }
    v.erase(v.begin()+v.size()/2, v.end());
    for(auto p: v) sum.push_back(p+(sum.empty() ? 0 : sum.back()));

    rep(i, 0, n)
    {
        int nl, nr;
        cin>>nl>>nr;
        cout<<sum.back()-sum[nl%v.size()]+sum[nr%v.size()+1]+(nr/v.size()-(nl+v.size()-1)/v.size())*sum.back()<<endl;
    }
    
    return 0;
}
/*
23 19 15 19 -9 19 15 19 23 -13 15 19 23 19 15 -13 kA+B
23 19 15 19 -9

51 -17 51 -17 51 -17

16-27
0 11
12 16 23
24 25 26 27
13 14 15 16
 */