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;
long long n, m, a[300005], dp[300005], sm[300005];
vector<long long> adj[300005];
long long vis[300005];
stack<long long> s;
void dfs(long long i, long long p) {
  vis[i] = 1;
  s.push(i);
  long long mx = LLONG_MIN, mn = LLONG_MAX;
  for (auto j : adj[i]) {
    if (!vis[j])
      dfs(j, i);
    else if (vis[j] == 1 && j != p) {
      while (s.top() != j) {
        mx = max(mx, s.top());
        mn = min(mn, s.top());
        s.pop();
      }
      mx = max(mx, s.top());
      mn = min(mn, s.top());
      s.pop();
      a[mn] = min(a[mn], mx);
      vis[i] = 2;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(a, 1000000007, sizeof(a));
  long long u, v;
  cin >> n >> m;
  for (long long i = (long long)0; i < (long long)m; i++) {
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (long long i = (long long)1; i < (long long)n + 1; i++) {
    if (!vis[i]) dfs(i, -1);
  }
  dp[n] = n;
  long long mn = n;
  for (long long i = (long long)n - 1; i >= (long long)1; i--) {
    mn = min(mn, a[i] - 1);
    dp[i] = mn;
  }
  sm[1] = dp[1];
  for (long long i = (long long)2; i < (long long)n + 1; i++)
    sm[i] = sm[i - 1] + dp[i];
  long long q, l, r, ans;
  cin >> q;
  while (q--) {
    cin >> l >> r;
    ans = 0;
    long long p = upper_bound(dp + l, dp + r + 1, r) - dp;
    ans = (r + 1) * (r - p + 1) - r * (r + 1) / 2 + p * (p - 1) / 2;
    ans += (sm[p - 1] - sm[l - 1] + p - l - p * (p - 1) / 2 + l * (l - 1) / 2);
    cout << ans << "\n";
  }
}
