import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum lim = 10^^9;
enum kmax = 10^^4;

void main() {
    int p, q;
    scan(p, q);

    auto rw = new long[](10^^5 + 1);
    foreach (i ; 1 .. 10^^5 + 1) {
        rw[i] = rw[i-1] + (p % i);
    }

    debug {
        //writeln(rw[0..30]);
    }

    long mrw(int r) {
        if (r <= 10^^5) {
            return rw[r];
        }

        long res;
        int am = 10^^9 + 7;

        foreach_reverse (k ; 0 .. kmax) {
            int s = p / (k + 1);
            int t = k == 0 ? 10^^9 + 7 : (p + k - 1) / k;

            am = min(am, s);

            t = min(r + 1, t);

            int le = t - s - 1;
            if (le <= 0) continue;

            debug {
                //writefln("%s, %s", s, t);
            }
            
            res += 1L * p * le;
            res -= 1L * k * ksum(s + 1, t);
        }

        res += rw[am];

        return res;
    }

    while (q--) {
        int li, ri;
        scan(li, ri);

        long ans = mrw(ri) - mrw(li-1);
        writeln(ans);
    }
}


// sum_{i = l}^{r - 1} k
long ksum(int l, int r) {
    if (l >= r) {
        return 0;
    }
    return 1L * r * (r - 1) / 2 - 1L * l * (l - 1) / 2;
}






















void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}