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 = 3e5 + 10;
vector<int> g[maxn];
bool vis[maxn];
stack<int> S;
int p[maxn];
long long sum[maxn];
void dfs(int u, int fa) {
  S.push(u);
  vis[u] = 1;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (v != fa) {
      if (vis[v] == 0)
        dfs(v, u);
      else if (vis[v] == 1) {
        int Max = 0, Min = maxn - 1;
        while (!S.empty()) {
          int w = S.top();
          S.pop();
          Max = max(Max, w);
          Min = min(Min, w);
          if (w == v) break;
        }
        p[Min] = Max;
      }
    }
  }
  if (!S.empty() && S.top() == u) S.pop();
  vis[u] = 2;
}
int main() {
  int n, m, q;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    g[a].push_back(b);
    g[b].push_back(a);
  }
  memset(vis, 0, sizeof vis);
  for (int i = 1; i <= n; i++) p[i] = n + 1;
  for (int i = 1; i <= n; i++) {
    if (vis[i] == 0) dfs(i, -1);
  }
  sum[n] = p[n + 1];
  for (int i = n - 1; i >= 1; i--) {
    p[i] = min(p[i], p[i + 1]);
    sum[i] = p[i] - i + sum[i + 1];
  }
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d%d", &l, &r);
    int L = l, R = r + 1, P = l;
    while (L <= R) {
      int M = L + R >> 1;
      if (p[M] <= r) {
        P = M;
        L = M + 1;
      } else
        R = M - 1;
    }
    printf("%lld\n", sum[l] - sum[P + 1] + 1LL * (r - P) * (r - P + 1) / 2);
  }
  return 0;
}
