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 MX = 3 * 1e5 + 5;
const int INF = 2 * 1e9 + 5;
int n, m, q;
int vis[MX], tmp_vis[MX], mn_end[MX];
long long pref_sum[MX];
set<int> g[MX];
vector<pair<int, int> > cycles;
int cycle_detected = 0;
int ref_node = -1;
void dfs(int u, int pa, vector<int>& nodes) {
  if (tmp_vis[u]) {
    tmp_vis[u] = 0;
    int mn_v = MX, mx_v = -1;
    while (nodes.back() != u) {
      mn_v = min(mn_v, nodes.back());
      mx_v = max(mx_v, nodes.back());
      nodes.pop_back();
    }
    mn_v = min(mn_v, u);
    mx_v = max(mx_v, u);
    cycles.push_back({mn_v, mx_v});
    cycle_detected = 1;
    ref_node = u;
    return;
  }
  if (vis[u]) return;
  tmp_vis[u] = vis[u] = 1;
  nodes.push_back(u);
  for (int v : g[u]) {
    if (cycle_detected) {
      if (u == ref_node) {
        cycle_detected = 0;
        ref_node = -1;
      }
      break;
    }
    if (v != pa) dfs(v, u, nodes);
  }
  tmp_vis[u] = 0;
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    g[u].insert(v);
    g[v].insert(u);
  }
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      vector<int> nodes;
      cycle_detected = 0;
      dfs(i, -1, nodes);
    }
  }
  scanf("%d", &q);
  sort(cycles.begin(), cycles.end());
  int csz = cycles.size();
  for (int i = 1; i <= n; i++) mn_end[i] = n;
  for (int i = csz - 1; i >= 0; i--)
    mn_end[cycles[i].first] = cycles[i].second - 1;
  for (int i = n - 1; i >= 1; i--) mn_end[i] = min(mn_end[i + 1], mn_end[i]);
  for (int i = 1; i <= n; i++) pref_sum[i] = mn_end[i] - i + 1;
  for (int i = 2; i <= n; i++) pref_sum[i] += pref_sum[i - 1];
  for (int i = 0; i < q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    int idx = lower_bound(mn_end + 1, mn_end + n + 1, r) - mn_end;
    long long res = 0;
    if (idx > l) res += pref_sum[idx - 1] - pref_sum[l - 1];
    int rem = r - idx + 1;
    res += (long long)rem * (rem + 1) / 2;
    printf("%lld\n", res);
  }
  return 0;
}
