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;
vector<long long> G[500009];
stack<long long> S;
long long vis[500009], p[500009], sum[500009];
long long cnt = 0;
void DFS(long long u, long long pa) {
  long long t;
  cnt++;
  vis[u] = cnt;
  S.push(u);
  for (auto v : G[u]) {
    if (v == pa) continue;
    if (!vis[v])
      DFS(v, u);
    else if (vis[v] < vis[u]) {
      long long mx = u, mn = u;
      while (!S.empty()) {
        t = S.top();
        S.pop();
        mx = max(mx, t);
        mn = min(mn, t);
        if (t == v) break;
      }
      p[mn] = mx;
    }
  }
}
int main() {
  long long N, M, i, j, k, a, b, l, r, L, R, Q;
  cin >> N >> M;
  for (i = 0; i < M; i++) {
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  for (i = 1; i <= N; i++) {
    p[i] = N + 1;
  }
  for (i = 1; i <= N; i++) {
    if (vis[i] == 0) DFS(i, 0);
  }
  sum[N] = 1;
  for (i = N - 1; i >= 1; i--) {
    p[i] = min(p[i], p[i + 1]);
    sum[i] = sum[i + 1] + p[i] - i;
  }
  for (i = 1; i <= N; i++) {
    cout << i << " ";
  }
  cout << endl;
  for (i = 1; i <= N; i++) {
    cout << p[i] << " ";
  }
  cout << endl;
  for (i = 1; i <= N; i++) {
    cout << sum[i] << " ";
  }
  cout << endl;
  cin >> Q;
  for (i = 0; i < Q; i++) {
    cin >> l >> r;
    L = l - 1;
    R = r;
    while (L + 1 < R) {
      long long mid = (L + R) / 2;
      if (p[mid] > r) {
        R = mid;
      } else {
        L = mid;
      }
    }
    cout << sum[l] - sum[R] + (r - R + 1) * (r - R + 2) / 2 << endl;
  }
}
