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;
int N, M, Q, vis[300009] = {};
long long int F[300009], last[300009];
vector<int> adjList[300009];
int vals[300009];
void dfs(int u, int p, int idx) {
  vis[u] = 1;
  vals[idx] = u;
  for (auto v : adjList[u]) {
    if (v == p || vis[v] == 2) continue;
    if (vis[v] == 1) {
      int wmax = u, wmin = u;
      for (int i = idx - 1; i >= 0; --i) {
        wmax = max(vals[i], wmax);
        wmin = min(vals[i], wmin);
        if (vals[i] == v) break;
      }
      last[wmax] = wmin;
    } else {
      dfs(v, u, idx + 1);
    }
  }
  vis[u] = 2;
}
int bs(int l, int r) {
  int mid;
  int a = l;
  while (l < r - 1) {
    mid = (l + r) >> 1;
    if (last[mid] < a)
      l = mid;
    else
      r = mid - 1;
  }
  if (last[r] < a) return r;
  return last[l] < a ? l : l - 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> N >> M;
  long long int a, b, dx;
  for (int i = 0; i < M; ++i) {
    cin >> a >> b;
    a--, b--;
    adjList[a].push_back(b);
    adjList[b].push_back(a);
  }
  cin >> Q;
  memset(last, -1, sizeof last);
  for (int i = 0; i < N; ++i) {
    if (!vis[i]) dfs(i, -1, 0);
  }
  F[0] = 1;
  for (int i = 1; i < N; ++i) {
    last[i] = max(last[i], last[i - 1]);
    F[i] = F[i - 1] + i - last[i];
  }
  while (Q--) {
    cin >> a >> b;
    --a, --b;
    int l = a;
    a = bs(a, b);
    dx = a - l + 1;
    dx = dx * (dx + 1) >> 1;
    cout << dx + F[b] - F[a] << '\n';
  }
}
