import java.util.Arrays; import java.util.HashMap; import java.util.Map; public class Main { private static void solve() { long p = ni(); int q = ni(); int[][] range = ntable(q, 2); Map dic = new HashMap<>(); long[] a = new long[q * 2 + 2]; int ptr = 0; a[ptr ++] = p; for (int[] v : range) { for (int i = 0; i < 2; i ++) { if (v[i] < p && !dic.containsKey((long)v[i] + i)) { a[ptr ++] = v[i] + i; dic.put((long)v[i] + i, 0L); } } } a = Arrays.copyOf(a, ptr); Arrays.sort(a); int s = ptr; long sum = 0; ptr = 0; for (long n = 1; n < p;) { long v = p / n; long left = 0; long right = Long.MAX_VALUE / 2; while (right - left > 1) { long k = (right + left) / 2; if (p / (n + k) == v) { left = k; } else { right = k; } } long to = right; long mod = p % n; while (ptr < s && n <= a[ptr] && a[ptr] < n + to) { long y = (a[ptr] - n); dic.put(a[ptr], sum + y * mod - v * y * (y - 1) / 2); ptr ++; } sum += to * mod - v * to * (to - 1) / 2; n += to; } for (int[] v : range) { long ret; if (v[0] >= p) { if (v[0] == p) { ret = (v[1] - v[0]) * p; } else { ret = (v[1] - v[0] + 1) * p; } } else if (v[1] >= p) { long l = v[0]; long r = p; long el = p + 1; long er = v[1] + 1; ret = dic.get(r) - dic.get(l); ret += Math.max(er - el, 0) * p; } else { long l = v[0]; long r = v[1] + 1; ret = dic.get(r) - dic.get(l); } out.println(ret); } } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }