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;
void testCase() {}
vector<int> graph[1000000];
vector<pair<int, int>> v;
bool visited[1000000];
int edeltaja[1000000];
long long prefsum[1000000];
bool syklissa[1000000];
void dfs(int node, int prevv) {
  if (visited[node]) {
    if (syklissa[node]) return;
    int suurin = node;
    int pienin = node;
    int solmu = edeltaja[node];
    syklissa[node] = true;
    while (solmu != node) {
      syklissa[solmu] = true;
      suurin = max(suurin, solmu);
      pienin = min(pienin, solmu);
      solmu = edeltaja[solmu];
    }
    v.push_back({pienin, suurin});
    return;
  }
  visited[node] = true;
  for (int x : graph[node]) {
    if (x == prevv) continue;
    edeltaja[x] = node;
    dfs(x, node);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  for (int i = 1; i <= n; i++) {
    if (!visited[i]) {
      dfs(i, -1);
    }
  }
  vector<pair<long long, long long>> w;
  vector<int> alut, loput;
  int pienin = 1e9;
  sort(v.begin(), v.end());
  for (int i = (int)v.size() - 1; i >= 0; i--) {
    if (v[i].second < pienin) {
      w.push_back(v[i]);
      pienin = v[i].second;
    }
  }
  sort(w.begin(), w.end());
  if (w.size() > 0) prefsum[0] = w[0].second * (w[0].second - 1) / 2;
  for (int i = 1; i < w.size(); i++) {
    auto p = w[i];
    long long koko = p.second - w[i - 1].first - 1;
    long long pois = w[i - 1].second - w[i - 1].first - 1;
    prefsum[i] = koko * (koko + 1) / 2 - pois * (pois + 1) / 2;
    prefsum[i] += prefsum[i - 1];
  }
  for (int i = 0; i < w.size(); i++) {
    alut.push_back(w[i].first);
    loput.push_back(w[i].second);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int x, y;
    cin >> x >> y;
    auto p = lower_bound(alut.begin(), alut.end(), x);
    int ind1 = p - alut.begin();
    p = upper_bound(loput.begin(), loput.end(), y);
    p--;
    int ind2 = p - loput.begin();
    if (ind1 > ind2) {
      long long k = y - x + 1;
      cout << k * (k + 1) / 2 << "\n";
    } else {
      long long ans = prefsum[ind2] - prefsum[ind1];
      long long idx = loput[ind1] - x;
      ans += idx * (idx + 1) / 2;
      long long koko = y - alut[ind2];
      long long pois = loput[ind2] - alut[ind2] - 1;
      ans += koko * (koko + 1) / 2 - pois * (pois + 1) / 2;
      cout << ans << "\n";
    }
  }
}
