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 nn = 3e5 + 8;
vector<int> G[nn];
int n, m;
int R[nn], pa[nn];
int trv[nn];
long long sum[nn];
void dfs(int u) {
  trv[u] = 1;
  for (int v : G[u]) {
    if (v == pa[u]) continue;
    if (!trv[v]) {
      pa[v] = u;
      dfs(v);
    } else if (trv[v] == 1) {
      int Max = v, Min = v;
      for (int i = u; i != v; i = pa[i]) {
        Max = max(Max, i);
        Min = min(Min, i);
      }
      R[Min] = Max - 1;
    }
  }
  trv[u] = 2;
}
int _find(int x, int l, int r) {
  int res = l - 1;
  int y = r;
  while (l <= r) {
    int m = (l + r) >> 1;
    if (R[m] <= y) {
      res = m;
      l = m + 1;
    } else
      r = m - 1;
  }
  return res;
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) R[i] = nn;
  for (int i = 1; i <= n; i++)
    if (!trv[i]) dfs(i);
  R[n] = n;
  for (int i = n - 1; i >= 1; i--) R[i] = min(R[i], R[i + 1]);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + (long long)(R[i] - i + 1);
  int q;
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d %d", &l, &r);
    int x = _find(r, l, r);
    long long res = sum[x] - sum[l - 1] + (long long)(r + 1) * (r - x) -
                    (long long)r * (r + 1) / 2 + (long long)x * (x + 1) / 2;
    printf("%lld\n", res);
  }
}
