#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----


const int M = 10000000;
LL p, q, L, s[M + 2];

LL fl(LL l, LL r) {
	if(l > L) { return 0; }
	setmin(r, L);
	return s[r] - s[l - 1];
}

LL g(LL i, LL l, LL r) {
	setmin(r, p / i);
	setmax(l, p / (i + 1) + 1);
	if(l > r) { return 0; }
	LL n = r - l + 1;
	return n * (n - 1) / 2 * i + p % r * n;
}

LL h(LL l, LL r) {
	setmax(l, p + 1);
	if(l > r) { return 0; }
	return (r - l + 1) * p;
}

LL fh(LL l, LL r) {
	if(r <= L) { return 0; }
	setmax(l, L + 1);
	LL ans = 0;
	inc1(i, 99) { ans += g(i, l, r); }
	ans += h(l, r);
	return ans;
}

int main() {
	cin >> p >> q;
	
	L = p / 100;
	assert(L <= M);
	incII(i, 1, L) { s[i] = p % i; }
	incII(i, 1, L) { s[i + 1] += s[i]; }
	
	inc(i, q) {
		int l, r;
		cin >> l >> r;
		
		LL ans = fl(l, r) + fh(l, r);
		cout << ans << "\n";
	}
	
	return 0;
}