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, l, r, ma, mi;
int timer;
vector<vector<long long> > g, u, num;
vector<long long> used, tin, fup;
vector<long long> pre, sum, z;
long long res, len;
void dfs(int v, int p = -1) {
  used[v] = 1;
  tin[v] = fup[v] = timer++;
  for (int i = 0; i < g[v].size(); ++i) {
    int to = g[v][i];
    if (to == p) continue;
    if (used[to])
      fup[v] = min(fup[v], tin[to]);
    else {
      dfs(to, v);
      fup[v] = min(fup[v], fup[to]);
      if (fup[to] > tin[v]) {
        u[v][i] = 0;
        u[to][num[v][i]] = 0;
      }
    }
  }
}
void dfss(int v) {
  used[v] = 1;
  mi = min(mi, v);
  ma = max(ma, v);
  for (int i = 0; i < g[v].size(); ++i) {
    if (!u[v][i]) continue;
    int to = g[v][i];
    if (!used[to]) dfss(to);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  g.resize(n);
  u.resize(n);
  num.resize(n);
  for (int i = 0; i < m; ++i) {
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    num[a].push_back(u[b].size());
    num[b].push_back(u[a].size());
    g[a].push_back(b);
    g[b].push_back(a);
    u[a].push_back(1);
    u[b].push_back(1);
  }
  timer = 0;
  used.assign(n, 0);
  tin.resize(n);
  fup.resize(n);
  for (int i = 0; i < n; ++i) {
    if (used[i]) continue;
    dfs(i);
  }
  z.assign(n, -1);
  used.assign(n, 0);
  for (int i = 0; i < n; ++i) {
    if (used[i]) continue;
    mi = n + 1;
    ma = -1;
    dfss(i);
    if (mi != ma) z[ma] = max(z[ma], (long long)mi);
  }
  pre.assign(n, 0);
  for (int i = 1; i < n; ++i) {
    pre[i] = z[i] + 1;
    pre[i] = max(pre[i], pre[i - 1]);
  }
  sum.assign(n, 1);
  for (int i = 1; i < n; ++i) sum[i] = sum[i - 1] + (i - pre[i] + 1);
  cin >> q;
  while (q--) {
    cin >> l >> r;
    --l;
    --r;
    len = (r - l + 1);
    if (pre[r] <= l)
      res = len * (len + 1) / 2;
    else if (pre[l] >= l)
      res = sum[r] - (l ? sum[l - 1] : 0);
    else {
      int le = l;
      int ri = r;
      while (ri - le > 1) {
        int mid = (le + ri) / 2;
        (pre[mid] < l ? le : ri) = mid;
      }
      len = (le - l + 1);
      res = len * (len + 1) / 2 + sum[r] - sum[le];
    }
    cout << res << "\n";
  }
  return 0;
}
