#include <bits/stdc++.h>
using namespace std;
const int INF = 500000;
vector<vector<int> > g;
vector<bool> use;
vector<int> path;
vector<pair<int, int> > cycles;
void dfs(int v, int parent) {
  use[v] = true;
  path.push_back(v);
  for (int i = 0; i < g[v].size(); i++) {
    int u = g[v][i];
    if (u != parent && use[u]) {
      int start = v;
      int end = v;
      for (int j = path.size() - 1; j >= 0; j--) {
        start = min(start, path[j]);
        end = max(end, path[j]);
        if (path[j] == u) break;
      }
      cycles.push_back(make_pair(start, end));
    }
  }
  for (int i = 0; i < g[v].size(); i++) {
    int u = g[v][i];
    if (!use[u]) {
      dfs(u, v);
    }
  }
  path.pop_back();
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  g.resize(n + 1);
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    g[x].push_back(y);
    g[y].push_back(x);
  }
  int q;
  scanf("%d", &q);
  vector<pair<int, int> > queries(q);
  for (int i = 0; i < q; i++)
    scanf("%d%d", &queries[i].first, &queries[i].second);
  use.resize(n + 1, false);
  path.reserve(n + 1);
  for (int i = 1; i <= n; i++) {
    if (!use[i]) {
      dfs(i, -1);
    }
  }
  cycles.push_back(make_pair(INF, INF));
  sort(cycles.begin(), cycles.end());
  int nCycles = cycles.size();
  vector<int> runningMin(nCycles);
  runningMin[nCycles - 1] = cycles[nCycles - 1].second;
  for (int i = nCycles - 2; i >= 0; i--) {
    runningMin[i] = min(runningMin[i + 1], cycles[i].second);
  }
  vector<int> mx(n + 1);
  vector<long long> prefMx(n + 1);
  prefMx[0] = 0;
  int cur = 0;
  for (int i = 1; i <= n; i++) {
    while (cycles[cur].first < i) cur++;
    mx[i] = runningMin[cur];
    prefMx[i] = prefMx[i - 1] + mx[i];
  }
  for (int z = 0; z < queries.size(); z++) {
    long long L = queries[z].first, R = queries[z].second;
    int ll = L, rr = R;
    while (ll <= rr) {
      int x = (ll + rr) / 2;
      if (mx[x] <= R)
        ll = x + 1;
      else
        rr = x - 1;
    }
    long long u = ll;
    long long result = (R - u + 1) * (R + 1) - (L + R) * (R - L + 1) / 2 +
                       prefMx[u - 1] - prefMx[L - 1];
    cout << result << endl;
  }
  return 0;
}
