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 n, m, q, used[300005], d[300005], up[300005], mn[300005], mx[300005],
    sf[300005];
vector<int> g[300005];
pair<int, int> t[4 * 300005];
long long pr[300005];
pair<int, int> merge(pair<int, int> a, pair<int, int> b) {
  return make_pair(max(a.first, b.first), min(a.second, b.second));
}
void upd(int v, int l, int r, int pos, pair<int, int> val) {
  if (l == r) {
    t[v] = val;
    return;
  }
  int m = (l + r) / 2;
  if (pos <= m)
    upd(v * 2, l, m, pos, val);
  else
    upd(v * 2 + 1, m + 1, r, pos, val);
  t[v] = merge(t[v * 2], t[v * 2 + 1]);
}
pair<int, int> get(int v, int l, int r, int i, int j) {
  if (i > j) return make_pair(0, 1000000007ll);
  if (l == i && r == j) return t[v];
  int m = (l + r) / 2;
  return merge(get(v * 2, l, m, i, min(j, m)),
               get(v * 2 + 1, m + 1, r, max(i, m + 1), j));
}
void dfs(int v, int p) {
  upd(1, 1, n, d[v], make_pair(v, v));
  used[v] = 1;
  mn[v] = 1000000007ll;
  vector<int> c;
  for (int i = 0; i < g[v].size(); i++) {
    int to = g[v][i];
    if (to == p) continue;
    if (used[to]) {
      if (d[to] < d[up[v]]) up[v] = to;
      continue;
    }
    d[to] = d[v] + 1;
    dfs(to, v);
    if (d[up[to]] < d[up[v]]) up[v] = up[to];
    c.push_back(to);
  }
  for (int i = 0; i < c.size(); i++) {
    int to = c[i];
    if (up[to] != up[v]) continue;
    mx[v] = max(mx[v], mx[to]);
    mn[v] = min(mn[v], mn[to]);
  }
  pair<int, int> mxn = get(1, 1, n, d[up[v]], d[v]);
  mx[v] = max(mx[v], mxn.first);
  mn[v] = min(mn[v], mxn.second);
  upd(1, 1, n, d[v], make_pair(0, 1000000007ll));
}
int main() {
  cin >> n >> m;
  while (m--) {
    int a, b;
    scanf("%d%d", &a, &b);
    g[a].push_back(b);
    g[b].push_back(a);
  }
  d[0] = 1000000007ll;
  for (int i = 1; i <= n; i++)
    if (!used[i]) {
      d[i] = 1;
      dfs(i, -1);
    }
  sf[n + 1] = 1000000007ll;
  for (int i = n; i >= 1; i--) {
    sf[i] = sf[i + 1];
    if (up[i] && mn[i] == i) sf[i] = min(sf[i], mx[i] - 1);
  }
  for (int i = 1; i <= n; i++) pr[i] = pr[i - 1] + sf[i] - i + 1;
  cin >> q;
  while (q--) {
    int L, R;
    scanf("%d%d", &L, &R);
    int l = L, r = R, m, pos = L - 1;
    while (l <= r) {
      m = (l + r) / 2;
      if (sf[m] <= R) {
        l = m + 1;
        pos = m;
      } else
        r = m - 1;
    }
    long long ans = pr[pos] - pr[L - 1];
    long long len = R - pos;
    ans += (len + 1ll) * (len) / 2;
    printf("%lld\n", ans);
  }
  return 0;
}
