#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> g[300010];
char used[300010];
int p[300010];
vector<int> s, t;
vector<vector<int> > cycles;
int a[300010];
int cyc_end[300010];
long long fen[300010];
void upd(int pos, int val) {
  for (; pos < n; pos |= (pos + 1)) {
    fen[pos] += val;
  }
}
long long get(int r) {
  long long result = 0;
  for (; r >= 0; r = (r & (r + 1)) - 1) {
    result += fen[r];
  }
  return result;
}
long long get(int l, int r) { return get(r) - get(l - 1); }
void dfs(int v, int par) {
  used[v] = true;
  for (int to : g[v]) {
    if (to != par) {
      if (!used[to]) {
        p[to] = v;
        dfs(to, v);
      } else {
        t.push_back(v);
        s.push_back(to);
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int from, to;
    cin >> from >> to;
    g[from - 1].push_back(to - 1);
    g[to - 1].push_back(from - 1);
  }
  for (int i = 0; i < n; i++) {
    if (!used[i]) {
      dfs(i, i);
    }
  }
  memset(used, 0, sizeof(used));
  for (int i = 0; i < (int)t.size(); i++) {
    if (used[t[i]]) continue;
    cycles.push_back(vector<int>());
    for (int v = t[i];; v = p[v]) {
      cycles.back().push_back(v);
      used[v] = true;
      if (v == s[i]) break;
    }
  }
  for (auto &vec : cycles) {
    sort(vec.begin(), vec.end());
    cyc_end[vec.front()] = vec.back();
  }
  a[n - 1] = n - 1;
  upd(n - 1, 1);
  for (int i = n - 2; i >= 0; i--) {
    if (cyc_end[i] == 0)
      a[i] = a[i + 1];
    else {
      a[i] = min(a[i + 1], cyc_end[i] - 1);
    }
    int val = a[i] - i + 1;
    upd(i, val);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    --l, --r;
    int lo = l - 1, hi = r;
    while (lo != hi) {
      int mi = (lo + hi + 1) >> 1;
      if (a[mi] > r)
        hi = mi - 1;
      else
        lo = mi;
    }
    long long an = get(l, lo);
    int len = r - lo;
    an += 1ll * len * (len + 1) / 2;
    cout << an << '\n';
  }
}
