#include <bits/stdc++.h>
using namespace std;
typedef int arr[600010];
arr head, pnt, Next, dfn, low, vis, flag, st, p;
long long s[300010];
int tot, n, m, q, tim, tp;
inline void add(int a, int b) {
  Next[++tot] = head[a];
  head[a] = tot;
  pnt[tot] = b;
  Next[++tot] = head[b];
  head[b] = tot;
  pnt[tot] = a;
}
inline void dfs(int x, int fa) {
  low[x] = dfn[x] = ++tim;
  vis[x] = 1;
  st[++tp] = x;
  flag[x] = 1;
  for (int i = head[x]; i; i = Next[i])
    if (pnt[i] != fa) {
      if (!vis[pnt[i]]) {
        dfs(pnt[i], x);
        low[x] = min(low[x], low[pnt[i]]);
      } else if (flag[pnt[i]])
        low[x] = min(low[x], dfn[pnt[i]]);
    }
  if (low[x] == dfn[x]) {
    int tt, Mn = INT_MAX, Mx = 0;
    do {
      tt = st[tp--];
      flag[tt] = 0;
      Mn = min(Mn, tt);
      Mx = max(Mx, tt);
    } while (tt != x);
    if (Mx != Mn) p[Mx] = max(p[Mx], Mn);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1, a, b; i <= m; i++) scanf("%d%d", &a, &b), add(a, b);
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) dfs(i, 0);
  for (int i = 1; i <= n; i++)
    p[i] = max(p[i], p[i - 1]), s[i] = s[i - 1] + p[i];
  scanf("%d", &q);
  for (int i = 1, l, r, x, y; i <= q; i++) {
    scanf("%d%d", &x, &y);
    l = x, r = y;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (p[mid] >= x)
        r = mid - 1;
      else
        l = mid + 1;
    }
    printf("%I64d\n", 1LL * (x + y) * (y - x + 1) / 2 + s[l - 1] - s[y] -
                          1LL * (x - 1) * (l - x));
  }
  return 0;
}
