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 + 7;
vector<int> G[N];
int vis[N] = {0}, p[N];
long long sum[N] = {0};
stack<int> s;
void dfs(int u, int fa) {
  s.push(u);
  vis[u] = 1;
  for (int i = 0; i < (int)G[u].size(); i++) {
    int v = G[u][i];
    if (v == fa) continue;
    if (!vis[v])
      dfs(v, u);
    else if (vis[v] == 1) {
      int maxx = u, minn = u;
      while (!s.empty()) {
        int t = s.top();
        s.pop();
        maxx = max(t, maxx);
        minn = min(t, minn);
        if (t == v) break;
      }
      p[minn] = maxx;
    }
  }
  if (!s.empty() && s.top() == u) s.pop();
  vis[u] = 2;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    G[x].push_back(y);
    G[y].push_back(x);
  }
  for (int i = 1; i <= n + 1; i++) p[i] = n + 1;
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i, -1);
  for (int i = n; i >= 1; i--) {
    p[i] = min(p[i], p[i + 1]);
    sum[i] = sum[i + 1] + p[i] - i;
  }
  int q;
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    int L = l, R = r + 1;
    while (L < R) {
      int m = (L + R) / 2;
      if (p[m] > r)
        R = m;
      else
        L = m + 1;
    }
    cout << sum[l] - sum[L] + 1ll * (r - L + 1) * (r - L + 2) / 2 << endl;
  }
  return 0;
}
