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 + 10;
long long n, m, q, u, v, l, r, c, res, sum[N], p[N], lmt[N];
vector<int> adj[N];
set<int> s;
set<int>::iterator it;
int findSet(int u) {
  if (p[u] < 0) return u;
  p[u] = findSet(p[u]);
  return p[u];
}
void unionSet(int u, int v) {
  u = findSet(u);
  v = findSet(v);
  if (u == v) return;
  if (u > v) swap(u, v);
  p[u] += p[v];
  p[v] = u;
}
void solve() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    cin >> u >> v;
    if (u > v) swap(u, v);
    adj[u].push_back(v);
  }
  for (int i = 0; i <= n; i++) {
    sort(adj[i].begin(), adj[i].end());
    p[i] = -1;
  }
  lmt[n] = n;
  sum[n] = 1;
  for (int i = n - 1; i >= 1; i--) {
    lmt[i] = lmt[i + 1];
    s.clear();
    for (int j = 0; j < adj[i].size(); j++) {
      v = adj[i][j];
      if (v > lmt[i]) break;
      u = findSet(v);
      it = s.find(u);
      if (it != s.end()) {
        lmt[i] = v - 1;
        break;
      }
      s.insert(u);
    }
    for (int j = 0; j < adj[i].size(); j++) {
      v = adj[i][j];
      if (v > lmt[i]) break;
      unionSet(i, v);
    }
    sum[i] = lmt[i] - i + 1;
  }
  sum[0] = 0;
  for (int i = 1; i <= n; i++) sum[i] += sum[i - 1];
  cin >> q;
  for (int i = 1, j; i <= q; i++) {
    cin >> l >> r;
    j = lower_bound(lmt + l, lmt + r + 1, r) - lmt;
    c = r + 1 - j;
    res = ((c * (c + 1)) / 2) + sum[j - 1] - sum[l - 1];
    cout << res << "\n";
  }
}
int main() {
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
