12 12
5 1
5 11
1 11
8 11
8 9
5 12
6 9
7 11
9 3
9 10
4 12
10 2
78
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
3 3
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
4 4
4 5
4 6
4 7
4 8
4 9
4 10
4 11
4 12
5 5
5 6
5 7
5 8
5 9
5 10
5 11
5 12
6 6
6 7
6 8
6 9
6 10
6 11
6 12
7 7
7 8
7 9
7 10
7 11
7 12
8 8
8 9
8 10
8 11
8 12
9 9
9 10
9 11
9 12
10 10
10 11
10 12
11 11
11 12
12 12

1
3
6
10
15
21
28
36
45
55
65
76
1
3
6
10
15
21
28
36
45
55
66
1
3
6
10
15
21
28
36
45
55
1
3
6
10
15
21
28
36
45
1
3
6
10
15
21
28
36
1
3
6
10
15
21
28
1
3
6
10
15
21
1
3
6
10
15
1
3
6
10
1
3
6
1
3
1

#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;
}
