#include <bits/stdc++.h>
using namespace std;
long long n, m, q, i, j, a, b, l, r, t, cnt, L, R, mid, sum[400000];
long long used[400000], p[400000], mx[400000];
vector<int> g[400000];
int cycle[400000], sz[400000];
void dfs(int v) {
  int i, to;
  used[v] = 1;
  for (i = 0; i < g[v].size(); i++) {
    to = g[v][i];
    if (p[v] == to) continue;
    if (used[to] == 1 && cycle[v] == -1) {
      int u = v, cnt = 1;
      while (u != to) {
        cycle[u] = t;
        cnt++;
        u = p[u];
      }
      cycle[to] = t;
      sz[t] = cnt;
      t++;
    }
    if (!used[to]) {
      p[to] = v;
      dfs(to);
    }
  }
  used[v] = 2;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (i = 0; i < m; i++) {
    cin >> a >> b;
    a--;
    b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  fill(cycle, cycle + n, -1);
  for (i = 0; i < n; i++) {
    if (!used[i]) dfs(i);
  }
  j = 0;
  for (i = 0; i < n; i++) {
    while (j < n && (cycle[j] == -1 || sz[cycle[j]] != 1)) {
      if (cycle[j] != -1) sz[cycle[j]]--;
      j++;
    }
    mx[i] = j - 1;
    sum[i] = ((i) ? sum[i - 1] : 0) + (mx[i] - i + 1);
    if (cycle[i] != -1) sz[cycle[i]]++;
  }
  cin >> q;
  for (i = 0; i < q; i++) {
    cin >> l >> r;
    l--;
    r--;
    L = l;
    R = r;
    while (L < R) {
      mid = (L + R) / 2;
      if (mx[mid] <= r)
        L = mid + 1;
      else
        R = mid;
    }
    cout << (r - L + 1) * (r - L + 2) / 2 + ((L) ? sum[L - 1] : 0) -
                ((l) ? sum[l - 1] : 0)
         << endl;
  }
  return 0;
}
