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;
inline int read() {
  register int res = 0, c, d = 0;
  while (c = getchar(), c < '0' || c > '9')
    ;
  do {
    res = (res << 3) + (res << 1) + (c ^ 48);
  } while (c = getchar(), c >= '0' && c <= '9');
  return res;
}
const int maxn = 300010;
vector<int> edge[maxn], dots;
stack<int> S;
bool vis[maxn];
int low[maxn], dfn[maxn], dep;
int To[maxn], cnt, xl[maxn], xr[maxn];
long long Sum[maxn];
void dfs(int x, int from) {
  low[x] = dfn[x] = dep++;
  vis[x] = 1;
  S.push(x);
  for (auto i : edge[x])
    if (i != from) {
      if (!vis[i]) {
        dfs(i, x);
        low[x] = min(low[x], low[i]);
      } else
        low[x] = min(low[x], dfn[i]);
    }
  if (low[x] == dfn[x]) {
    xl[cnt] = xr[cnt] = x;
    do {
      xl[cnt] = min(xl[cnt], S.top());
      xr[cnt] = max(xr[cnt], S.top());
      if (S.top() == x) break;
      S.pop();
    } while (1);
    S.pop();
    cnt++;
  }
}
int main() {
  int N = read(), M = read();
  for (int i = 1; i <= M; i++) {
    int l = read(), r = read();
    edge[l].push_back(r);
    edge[r].push_back(l);
  }
  for (int i = 1; i <= N; i++) To[i] = N;
  for (int i = 1; i <= N; i++)
    if (!vis[i]) {
      dfs(i, 0);
    }
  for (int i = 0; i < cnt; i++) {
    To[xl[i]] = xr[i] - 1;
  }
  for (int i = N - 1; i; i--) {
    To[i] = min(To[i], To[i + 1]);
  }
  for (int i = 1; i <= N; i++) {
    Sum[i] = Sum[i - 1] + (To[i] - i + 1);
  }
  int Q = read();
  for (int i = 1; i <= Q; i++) {
    int l = read(), r = read(), L = l - 1, R = r + 1;
    while (L + 1 < R) {
      int mid = L + R >> 1;
      if (To[mid] > r)
        R = mid;
      else
        L = mid;
    }
    long long ans = Sum[L] - Sum[l - 1] + 1ll * (r - L) * (r - L + 1) / 2;
    printf("%lld\n", ans);
  }
  return 0;
}
