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, a, b, q, mx[300005];
long long acu[300005];
vector<vector<int> > adj;
int maxi, mini, p[300005];
void ciclo(int u, int v) {
  if (v == u) return;
  maxi = max(u, maxi);
  mini = min(u, mini);
  ciclo(p[u], v);
}
vector<int> vis;
void dfs(int u) {
  vis[u] = 1;
  for (int v : adj[u]) {
    if (vis[v]) {
      if (vis[v] == 1 && v != p[u]) {
        maxi = mini = v;
        ciclo(u, v);
        mx[mini] = min(mx[mini], maxi - 1);
      }
    } else {
      p[v] = u;
      dfs(v);
    }
  }
  vis[u] = 2;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  adj = vector<vector<int> >(n + 1);
  while (m--) {
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  vis = vector<int>(n + 1);
  fill(mx, mx + n + 1, n);
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      p[i] = i;
      dfs(i);
    }
  }
  for (int i = n - 1; i; i--) mx[i] = min(mx[i], mx[i + 1]);
  acu[0] = 0;
  for (int i = 1; i <= n; i++) acu[i] = acu[i - 1] + mx[i] - i + 1;
  cin >> q;
  while (q--) {
    cin >> a >> b;
    long long x = lower_bound(mx + 1, mx + n + 1, b) - mx;
    if (x < a) {
      x = b - a + 1;
      cout << x * (x + 1) / 2 << '\n';
    } else {
      long long d = b - x + 1;
      cout << d * (d + 1) / 2 + acu[x - 1] - acu[a - 1] << '\n';
    }
  }
  return 0;
}
