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 MAXN = 300005;
vector<int> a[MAXN];
int parent[MAXN], dfn[MAXN], sum[MAXN], mx[MAXN];
bool check[MAXN];
vector<pair<int, int> > segment;
int timer = 0;
pair<int, int> find_cycle(int start, int end) {
  int maxi = start, mini = start;
  while (start != end) {
    start = parent[start];
    maxi = max(maxi, start);
    mini = min(mini, start);
  }
  return {mini, maxi};
}
void dfs(int node) {
  check[node] = true;
  dfn[node] = ++timer;
  for (int next : a[node]) {
    if (!check[next]) {
      parent[next] = node;
      dfs(next);
    } else if (next != parent[node] && dfn[node] > dfn[next]) {
      auto p = find_cycle(node, next);
      segment.push_back(p);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    a[x].push_back(y);
    a[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) {
    if (!check[i]) dfs(i);
  }
  fill(mx + 1, mx + 1 + n, n);
  for (int i = 0; i < segment.size(); i++) {
    auto p = segment[i];
    mx[p.first] = p.second - 1;
  }
  for (int i = n - 1; i >= 1; i--) mx[i] = min(mx[i], mx[i + 1]);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + mx[i];
  int q;
  cin >> q;
  for (int qq = 0; qq < q; qq++) {
    int s, e;
    cin >> s >> e;
    int left = s, right = e, mid, idx = s - 1;
    while (left <= right) {
      int mid = (left + right) >> 1;
      if (mx[mid] <= e) {
        idx = mid;
        left = mid + 1;
      } else {
        right = mid - 1;
      }
    }
    int sum1 = sum[idx] - sum[s - 1] + e * (e - idx);
    int sum2 = (s + e) * (e - s + 1) / 2 - (e - s + 1);
    cout << sum1 - sum2 << "\n";
  }
  return 0;
}
