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 long long mod = 1e9 + 7, siz = 1e6 + 5;
vector<long long> g[siz];
long long n, t, m, k, a[siz], sum[siz], l[siz], vis[siz];
stack<long long> st;
void go(long long u, long long p) {
  vis[u] = 1;
  st.push(u);
  for (auto v : g[u]) {
    if (v == p) continue;
    if (!vis[v]) go(v, u);
    if (vis[v] == 1) {
      stack<long long> cur;
      long long mn = 1e9, mx = 0;
      while (st.top() != v) {
        mn = min(mn, st.top());
        mx = max(mx, st.top());
        cur.push(st.top());
        st.pop();
      }
      l[mx] = mn;
      while (cur.size()) st.push(cur.top()), cur.pop();
    }
  }
  if (st.size() and st.top() == u) st.pop();
  vis[u] = 2;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (long long i = 1; i <= m; i++) {
    long long x, y;
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (long long i = 1; i <= n; i++)
    if (!vis[i]) go(i, 0);
  for (long long i = 1; i <= n; i++) {
    l[i] = max(l[i - 1], l[i]);
    sum[i] = sum[i - 1] + i - l[i];
  }
  long long q;
  cin >> q;
  while (q--) {
    long long lft, rit;
    cin >> lft >> rit;
    long long L = lft, R = rit;
    long long pos_left = lower_bound(l + lft, l + 1 + n, lft) - l;
    long long ans = (pos_left - lft) * (pos_left - lft + 1) / 2;
    ans += sum[rit] - sum[pos_left - 1];
    cout << ans << endl;
  }
}
