#include <bits/stdc++.h>
using namespace std;
long long n, m, a[300005], dp[300005], sm[300005];
vector<long long> adj[300005];
long long vis[300005];
stack<long long> s;
void dfs(long long i, long long p) {
  vis[i] = 1;
  s.push(i);
  long long mx = LLONG_MIN, mn = LLONG_MAX;
  for (auto j : adj[i]) {
    if (!vis[j])
      dfs(j, i);
    else if (vis[j] == 1 && j != p) {
      while (s.top() != j) {
        mx = max(mx, s.top());
        mn = min(mn, s.top());
        s.pop();
      }
      mx = max(mx, s.top());
      mn = min(mn, s.top());
      s.pop();
      a[mn] = min(a[mn], mx);
      vis[i] = 2;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(a, 1000000007, sizeof(a));
  long long u, v;
  cin >> n >> m;
  for (long long i = (long long)0; i < (long long)m; i++) {
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (long long i = (long long)1; i < (long long)n + 1; i++) {
    if (!vis[i]) dfs(i, -1);
  }
  dp[n] = n;
  long long mn = n;
  for (long long i = (long long)n - 1; i >= (long long)1; i--) {
    mn = min(mn, a[i] - 1);
    dp[i] = mn;
  }
  sm[1] = dp[1];
  for (long long i = (long long)2; i < (long long)n + 1; i++)
    sm[i] = sm[i - 1] + dp[i];
  long long q, l, r, ans;
  cin >> q;
  while (q--) {
    cin >> l >> r;
    ans = 0;
    long long p = upper_bound(dp + l, dp + r + 1, r) - dp;
    ans = (r + 1) * (r - p + 1) - r * (r + 1) / 2 + p * (p - 1) / 2;
    ans += (sm[p - 1] - sm[l - 1] + p - l - p * (p - 1) / 2 + l * (l - 1) / 2);
    cout << ans << "\n";
  }
}
