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;
class SegmentTree {
  vector<int> stmin, stmax;
  int n;

 public:
  SegmentTree(int sz) {
    for (n = 1; n < sz; n <<= 1)
      ;
    stmin.assign(n << 1, 300009);
    stmax.assign(n << 1, 0);
  }
  void update(int i, int x) {
    stmax[i + n] = x;
    stmin[i + n] = x;
    for (i += n, i >>= 1; i; i >>= 1) {
      stmax[i] = max(stmax[i << 1], stmax[1 + (i << 1)]);
      stmin[i] = min(stmin[i << 1], stmin[1 + (i << 1)]);
    }
  }
  int maxquery(int l, int r) {
    int ans = 0;
    for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
      if (l & 1) ans = max(ans, stmax[l++]);
      if (r & 1) ans = max(ans, stmax[--r]);
    }
    return ans;
  }
  int minquery(int l, int r) {
    int ans = 300009;
    for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
      if (l & 1) ans = min(ans, stmin[l++]);
      if (r & 1) ans = min(ans, stmin[--r]);
    }
    return ans;
  }
};
SegmentTree st(300009);
int num[300009], pos[300009], last[300009], am[300009], cnt, N, M;
long long sum[300009];
vector<int> adjList[300009];
void dfs(int u, int p) {
  num[u] = 1;
  pos[u] = cnt++;
  st.update(pos[u], u);
  for (int i = 0; i < (int)adjList[u].size(); i++) {
    int v = adjList[u][i];
    if (v == p) continue;
    if (num[v] == 0)
      dfs(v, u);
    else if (num[v] == 1) {
      int mi = st.minquery(pos[v], pos[u]);
      int ma = st.maxquery(pos[v], pos[u]);
      last[mi] = min(last[mi], ma - 1);
    }
  }
  num[u] = 2;
  cnt--;
}
int main() {
  scanf("%d %d", &N, &M);
  for (int j = 0; j < M; j++) {
    int u, v;
    scanf("%d %d", &u, &v);
    adjList[u].push_back(v);
    adjList[v].push_back(u);
  }
  for (int u = 1; u <= N; u++) {
    last[u] = N;
    num[u] = 0;
  }
  cnt = 0;
  for (int u = 1; u <= N; u++) {
    if (num[u] == 0) dfs(u, -1);
  }
  for (int u = N - 1; u >= 1; u--) {
    last[u] = min(last[u], last[u + 1]);
  }
  sum[0] = 0;
  for (int u = 1; u <= N; u++) {
    am[u] = last[u] - u + 1;
    sum[u] = am[u] + sum[u - 1];
  }
  int Q, l, r;
  scanf("%d", &Q);
  for (int q = 0; q < Q; q++) {
    scanf("%d %d", &l, &r);
    int lo = l - 1;
    int hi = r + 1;
    while (hi > lo + 1) {
      int mid = (hi + lo) / 2;
      if (last[mid] > r)
        hi = mid;
      else
        lo = mid;
    }
    int n = r - hi + 1;
    long long ans = n * (n + 1LL) / 2 + sum[lo] - sum[l - 1];
    printf("%I64d\n", ans);
  }
  return 0;
}
