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;
int now[5 * 100010], after[5 * 100010], mx[5 * 100010];
int lft[5 * 100010], rgt[5 * 100010], vi[5 * 100010], timer = 0, comp = 0;
long long Add[5 * 100010];
vector<int> g[5 * 100010];
stack<int> stk;
inline void dfs(int c, int p) {
  vi[c] = 1;
  now[c] = after[c] = ++timer;
  stk.push(c);
  for (auto x : g[c]) {
    if (x != p) {
      if (!vi[x]) {
        dfs(x, c);
        now[c] = min(now[c], now[x]);
      } else
        now[c] = min(now[c], after[x]);
    }
  }
  if (now[c] == after[c]) {
    lft[comp] = rgt[comp] = c;
    while (1) {
      int node = stk.top();
      lft[comp] = min(lft[comp], node);
      rgt[comp] = max(rgt[comp], node);
      if (node == c) break;
      stk.pop();
    }
    stk.pop();
    comp++;
  }
}
int main() {
  int n, m;
  scanf("%d", &n);
  ;
  scanf("%d", &m);
  ;
  memset(vi, 0, sizeof(vi));
  ;
  for (int x = 1; x <= m; x++) {
    int u, v;
    scanf("%d", &u);
    ;
    scanf("%d", &v);
    ;
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }
  for (int x = 1; x <= n; x++)
    if (!vi[x]) dfs(x, 0);
  for (int x = 1; x <= n; x++) mx[x] = n;
  for (int x = 0; x < comp; x++)
    if (lft[x] != rgt[x]) mx[lft[x]] = rgt[x] - 1;
  for (int x = n - 1; x >= 1; x--) mx[x] = min(mx[x + 1], mx[x]);
  for (int x = 1; x <= n; x++) Add[x] = Add[x - 1] + mx[x] - x + 1;
  int q;
  scanf("%d", &q);
  ;
  while (q--) {
    int from, to;
    scanf("%d", &from);
    ;
    scanf("%d", &to);
    ;
    int l = from - 1, r = to + 1, chk = from;
    while (l + 1 < r) {
      int m = l + r >> 1;
      if (mx[m] > to)
        r = m;
      else
        chk = max(chk, m), l = m;
    }
    chk = l;
    printf("%lld\n",
           Add[chk] - Add[from - 1] + 1LL * (to - chk) * (to - chk + 1LL) / 2);
  }
}
