#include <bits/stdc++.h>
using namespace std;
long long seg[500001], sum[500001];
long long mp[500001] = {0};
vector<long long> g[500001];
bool see[500001];
long long depth[500001], p[500001];
multiset<long long> ep;
multiset<long long>::iterator it;
void dfs(long long u, long long par, long long d) {
  see[u] = 1;
  p[u] = par;
  depth[u] = d;
  for (long long i = 0; i < g[u].size(); i++) {
    long long v = g[u][i];
    if (!see[v])
      dfs(v, u, d + 1);
    else if (depth[v] < depth[u] && v != par) {
      long long x = u, mn = v, mx = v;
      while (v != x) {
        mn = min(mn, x);
        mx = max(mx, x);
        x = p[x];
      }
      mp[mn] = mx;
      ep.insert(mx);
    }
  }
  return;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, e;
  cin >> n >> e;
  for (long long i = 0; i < e; i++) {
    long long u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  memset(see, 0, sizeof see);
  for (long long i = 1; i <= n; i++) {
    if (!see[i]) {
      dfs(i, 0, 0);
    }
  }
  memset(sum, 0, sizeof sum);
  for (long long i = 1; i <= n; i++) {
    if (ep.size()) {
      it = ep.begin();
      seg[i] = *it - 1;
    } else
      seg[i] = n;
    if (mp[i] != 0) ep.erase(ep.find(mp[i]));
    sum[i] = sum[i - 1] + seg[i] - i + 1;
  }
  int q, l, r;
  cin >> q;
  while (q--) {
    cin >> l >> r;
    long long ans = 0;
    if (seg[r] > r) {
      long long* id = lower_bound(seg + l, seg + r, r + 1);
      long long temp = (id - seg);
      ans += (r - temp + 1) * (r - temp + 2) / 2;
      ans += (sum[temp - 1] - sum[l - 1]);
    } else
      ans = sum[r] - sum[l - 1];
    cout << ans << endl;
  }
  return 0;
}
