#include <bits/stdc++.h>
using namespace std;
const int nn = 3e5 + 8;
vector<int> G[nn];
int n, m;
int R[nn], pa[nn];
int trv[nn];
long long sum[nn], sum2[nn];
void dfs(int u) {
  trv[u] = 1;
  for (int v : G[u]) {
    if (v == pa[u]) continue;
    if (!trv[v]) {
      pa[v] = u;
      dfs(v);
    } else if (trv[v] == 1) {
      int Max = v, Min = v;
      for (int i = u; i != v; i = pa[i]) {
        Max = max(Max, i);
        Min = min(Min, i);
      }
      R[Min] = Max - 1;
    }
  }
  trv[u] = 2;
}
int _find(int x, int l, int r) {
  int res = l - 1;
  int y = r;
  while (l <= r) {
    int m = (l + r) >> 1;
    if (R[m] <= y) {
      res = m;
      l = m + 1;
    } else
      r = m - 1;
  }
  return res;
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) R[i] = nn;
  for (int i = 1; i <= n; i++)
    if (!trv[i]) dfs(i);
  R[n] = n;
  for (int i = n - 1; i >= 1; i--) R[i] = min(R[i], R[i + 1]);
  for (int i = 1; i <= n; i++) {
    sum[i] = sum[i - 1] + (long long)(R[i] - i + 1);
    sum2[i] = sum2[i - 1] + i;
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d %d", &l, &r);
    int x = _find(r, l, r);
    long long res =
        sum[x] - sum[l - 1] + (long long)(r + 1) * (r - x) - sum2[r] + sum2[x];
    printf("%lld\n", res);
  }
}
