#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include #include #include using namespace std; using namespace atcoder; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++) typedef long long ll; typedef unsigned long long ull; const ll inf=1e18; using graph = vector > ; using P= pair; using vi=vector; using vvi=vector; using vll=vector; using vvll=vector; using vp=vector

; using vvp=vector; using vd=vector; using vvd =vector; //string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //string S="abcdefghijklmnopqrstuvwxyz"; //g++ main.cpp -std=c++17 -I . //cout < bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; } template bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; } // https://youtu.be/L8grWxBlIZ4?t=9858 // https://youtu.be/ERZuLAxZffQ?t=4807 : optimize // https://youtu.be/8uowVvQ_-Mo?t=1329 : division ll mod =998244353; //ll mod =1e9+7; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} // combination mod prime // https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619 struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { //assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; if (n<0) return 0; return fact[n]*ifact[k]*ifact[n-k]; } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(2000000); using vm=vector ; using vvm=vector ; struct edge{ int to; ll cost; edge(int to,ll cost) : to(to),cost(cost){} }; using ve=vector; using vve=vector; struct Compress{ vll a; map d,d2; int cnt; Compress() :cnt(0) {} void add(ll x){a.push_back(x);} void init(){ sets(a.begin(),a.end()); for(auto y:s)d[y]=cnt++; for(auto&y:a)y=d[y]; for(auto u:d)d2[u.second]=u.first; } ll to(ll x){return d[x];} //変換先 ll from(ll x){return d2[x];}//逆引き int size(){return cnt;} }; vll anss; void solve(int test){ ll p,q; cin >> p >> q; vi vs; { int now=1; vs.push_back(now); while(1){ int wa=now,ac=p; while(ac-wa>1){ int wj=(wa+ac)/2; if(p/wj!=p/now)ac=wj; else wa=wj; } vs.push_back(ac); now=ac; if(p/ac==1)break; } vs.push_back(p+1); } // for(auto u:vs)debug(u); //d//ebug(1); int si=vs.size()-1; vll val(si+1); vll sum(si+1); auto f=[&](int l,int r){ ll res=1ll*(l+r)*(r-l+1)/2; return res; }; repi(i,1,si+1){ val[i]=p*(vs[i+1-1]-vs[i-1]); val[i]-=f(vs[i-1],vs[i+1-1]-1)*(p/vs[i-1]); } repi(i,1,si+1)sum[i]=sum[i-1]+val[i]; auto g=[&](ll r){ if(r>=p){ return sum[si]+(r-p)*p; } else { int index=upper_bound(vs.begin(),vs.end(),r)-vs.begin(); index--; if(index==0)return sum[1]; else { ll res=sum[index-1+1]+p*(r-vs[index]+1)-f(vs[index],r)*(p/r); return res; } } }; rep(qi,q){ int l,r; cin >>l >> r; ll ans=g(r); if(l-1)ans-=g(l-1); anss.push_back(ans); } } //g++ main.cpp -std=c++17 -I . int main(){cin.tie(0);ios::sync_with_stdio(false); int t=1;//cin >> t; rep(test,t)solve(test); for(auto u:anss)cout << u << endl; }