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;
const int maxn = 1e5 + 10;
long long n, m, q, l, r;
long long vis[3 * maxn], cir[3 * maxn], suff[3 * maxn];
vector<long long> G[3 * maxn];
stack<long long> path;
void dfs(long long now, long long pre) {
  path.push(now);
  vis[now] = 1;
  for (int i = 0; i < (int)G[now].size(); i++) {
    long long Next = G[now][i];
    if (Next == pre) continue;
    if (!vis[Next]) dfs(Next, now);
    if (vis[Next] == 1) {
      long long maxc = now, minc = now;
      while (!path.empty()) {
        long long temp = path.top();
        path.pop();
        maxc = max(maxc, temp), minc = min(minc, temp);
        if (temp == Next) break;
      }
      cir[minc] = maxc;
    }
  }
  if (!path.empty() && path.top() == now) path.pop();
  vis[now] = 2;
}
int main() {
  scanf("%lld %lld", &n, &m);
  for (int i = 1; i <= m; i++) {
    long long u, v;
    scanf("%lld %lld", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i <= n + 1; i++) cir[i] = n + 1;
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) dfs(i, 0);
  }
  suff[n] = suff[n + 1] = 0;
  for (int i = n; i >= 1; i--) cir[i] = min(cir[i], cir[i + 1]);
  for (int i = n; i >= 1; i--) suff[i] = cir[i] - i + suff[i + 1];
  scanf("%lld", &q);
  while (q--) {
    scanf("%lld %lld", &l, &r);
    long long L = l, R = r, p;
    while (L <= R) {
      long long m = (L + R) / 2;
      if (cir[m] <= r) {
        L = m + 1;
      } else {
        p = m;
        R = m - 1;
      }
    }
    long long ans = suff[l] - suff[p] + (r - p + 1) * (r - p + 2) / 2;
    printf("%lld\n", ans);
  }
  return 0;
}
