#include <bits/stdc++.h>
using namespace std;
const int _ = 3e5 + 10;
const int INF = 0x3f3f3f3f;
int N, M, R[_];
vector<int> E[_];
int tot, head[_], to[_ << 1], nxt[_ << 1];
long long sum[_];
inline int ty() {
  char ch = getchar();
  int x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
void adde(int x, int y) {
  to[++tot] = y;
  nxt[tot] = head[x];
  head[x] = tot;
}
int num, dfn[_], low[_];
int stk[_], top;
void tarjan(int x, const int root) {
  dfn[x] = low[x] = ++num;
  stk[++top] = x;
  if (x == root && head[x] == 0) return;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = to[i];
    if (!dfn[y]) {
      tarjan(y, root);
      low[x] = min(low[x], low[y]);
      if (dfn[x] <= low[y]) {
        int z, maxx = 0, minx = INF;
        int cnt = 0;
        do {
          ++cnt;
          z = stk[top--];
          maxx = max(maxx, z);
          minx = min(minx, z);
        } while (z != y);
        ++cnt;
        maxx = max(maxx, x);
        minx = min(minx, x);
        if (cnt >= 3) R[minx] = min(R[minx], maxx);
      }
    } else
      low[x] = min(low[x], dfn[y]);
  }
}
int main() {
  N = ty(), M = ty();
  int T, x, y;
  for (int i = 1; i <= M; ++i) {
    x = ty(), y = ty();
    adde(x, y);
    adde(y, x);
  }
  fill(R + 1, R + N + 1, INF);
  for (int i = 1; i <= N; ++i)
    if (!dfn[i]) tarjan(i, i);
  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] + R[i];
  long long ans;
  T = ty();
  while (T--) {
    x = ty(), y = ty();
    int l = x, r = y;
    while (l < r) {
      int mid = (l + r) >> 1;
      if (R[mid] > y)
        r = mid;
      else
        l = mid + 1;
    }
    ans = 0;
    ans += sum[l - 1] - sum[x - 1] - 1ll * (x + l - 1) * (l - x) / 2;
    int len = y - l + 1;
    ans += 1ll * len * (len + 1) / 2;
    printf("%lld\n", ans);
  }
  return 0;
}
