#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 5;
long long read() {
  long long s = 0;
  char c = getchar(), lc = '+';
  while (c < '0' || '9' < c) lc = c, c = getchar();
  while ('0' <= c && c <= '9') s = s * 10 + c - '0', c = getchar();
  return lc == '-' ? -s : s;
}
void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x < 10)
    putchar(x + '0');
  else
    write(x / 10), putchar(x % 10 + '0');
}
void print(long long x = -1, char c = '\n') {
  write(x);
  putchar(c);
}
struct edge {
  long long to, nxt;
} e[N * 2];
long long head[N], cnte = 0;
void add_edge(long long u, long long v) {
  e[++cnte].to = v;
  e[cnte].nxt = head[u];
  head[u] = cnte;
}
long long ri[N], sum[N], fa[N], deep[N];
long long sigma(long long x) { return x * (x + 1) / 2; }
void dfs(long long now, long long father) {
  fa[now] = father;
  deep[now] = deep[father] + 1;
  for (long long i = head[now]; i; i = e[i].nxt) {
    long long to = e[i].to;
    if (to == father) continue;
    if (fa[to]) {
      if (deep[to] > deep[now]) continue;
      long long l = to, r = to;
      for (long long k = now; k != to; k = fa[k]) l = min(l, k), r = max(r, k);
      ri[l] = r - 1;
    } else
      dfs(to, now);
  }
}
signed main(signed Goodbye, char *Wangang[]) {
  (void)Goodbye, (void)Wangang;
  long long n = read(), m = read();
  for (long long i = 1; i <= m; i++) {
    long long u = read(), v = read();
    add_edge(u, v);
    add_edge(v, u);
  }
  for (long long i = 1; i <= n + 1; i++) ri[i] = n;
  for (long long i = 1; i <= n; i++)
    if (!fa[i]) dfs(i, -1);
  for (long long i = n; i >= 1; i--) ri[i] = min(ri[i], ri[i + 1]);
  for (long long i = n; i >= 1; i--) sum[i] = sum[i + 1] + ri[i] - i + 1;
  long long q = read();
  while (q--) {
    long long l = read(), r = read();
    long long pos = upper_bound(ri + l, ri + r + 1, r) - ri;
    print(sum[l] - sum[pos] + sigma(r - pos + 1));
  }
  return 0;
}
