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 + 5;
vector<int> adj[N];
int vis[N];
vector<int> points;
int goTill[N];
long long sum[N];
void dfs(int v, int p) {
  vis[v] = 1;
  points.push_back(v);
  for (auto it : adj[v]) {
    if (it == p || vis[it] == 2) continue;
    if (!vis[it]) {
      dfs(it, v);
      continue;
    }
    int mn = v, mx = v;
    for (auto pt = points.rbegin();; pt++) {
      mn = min(mn, *pt);
      mx = max(mx, *pt);
      if (*pt == it) break;
    }
    goTill[mn] = min(goTill[mn], mx - 1);
  }
  points.pop_back();
  vis[v] = 2;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  while (m--) {
    int ai, bi;
    cin >> ai >> bi;
    adj[ai].push_back(bi);
    adj[bi].push_back(ai);
  }
  for (int i = 1; i <= n; i++) {
    goTill[i] = n;
  }
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) dfs(i, 0);
  }
  for (int i = n - 1; i >= 1; i--) {
    goTill[i] = min(goTill[i], goTill[i + 1]);
  }
  for (int i = 1; i <= n; i++) {
    sum[i] = goTill[i] - i + 1;
    sum[i] += sum[i - 1];
  }
  int q;
  cin >> q;
  while (q--) {
    int li, ri;
    cin >> li >> ri;
    int p = lower_bound(goTill + li, goTill + ri, ri) - goTill;
    long long ans = sum[p - 1] - sum[li - 1];
    long long cnt = ri - p + 1;
    cnt = (cnt * (cnt + 1)) / 2;
    ans += cnt;
    cout << ans << "\n";
  }
  return 0;
}
