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 N = 3e5 + 1;
const int M = 1e9 + 7;
const double eps = 1e-6;
const double PI(acos(-1.0));
int n, m, q;
vector<int> g[N];
stack<int> s;
int vis[N];
int d[N];
void dfs(int u, int p) {
  vis[u] = 1;
  s.push(u);
  for (auto v : g[u]) {
    if (v == p) continue;
    if (!vis[v]) {
      dfs(v, u);
    } else if (vis[v] == 1) {
      int l = u, r = u;
      while (s.size()) {
        int t = s.top();
        s.pop();
        l = min(l, t);
        r = max(r, t);
        if (t == v) break;
      }
      d[l] = r;
    }
  }
  if (s.size() && s.top() == u) s.pop();
  vis[u] = 2;
}
long long sum[N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < (m); i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  for (int i = (1); i <= (n + 1); i++) d[i] = n + 1;
  for (int i = (1); i <= (n); i++) {
    if (!vis[i]) {
      dfs(i, -1);
    }
  }
  for (int i = n; i; i--) {
    d[i] = min(d[i], d[i + 1]);
    sum[i] = sum[i + 1] + d[i] - i;
  }
  cin >> q;
  int l, r;
  for (int i = 0; i < (q); i++) {
    cin >> l >> r;
    int L = l, R = r, m, t;
    while (L <= R) {
      m = L + R >> 1;
      if (d[m] <= r) {
        L = m + 1;
      } else {
        t = m;
        R = m - 1;
      }
    }
    L = t;
    long long c = r - L + 1;
    cout << sum[l] - sum[L] + 1LL * c * (c + 1) / 2 << endl;
  }
}
