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>
const int MAXN = 300000 + 10;
const int MAXM = 600000 + 10;
char buffer[MAXN * 2 * 50];
int N, M, Q;
int cnt = 1, head[MAXN], next[MAXM], to[MAXM];
int dfn[MAXN], low[MAXN], stack[MAXN], tot, top, sum;
int maxx[MAXN], minx[MAXN];
int To[MAXN];
long long Sum[MAXN];
long long ans;
char *ch;
inline void read(int &x) {
  x = 0;
  while (*ch < '0' || *ch > '9') ++ch;
  while (*ch >= '0' && *ch <= '9') x = (x << 1) + (x << 3) + *ch - 48, ++ch;
}
inline int min(int x, int y) { return x < y ? x : y; }
inline int max(int x, int y) { return x < y ? y : x; }
inline void insert(int x, int y) {
  next[++cnt] = head[x], to[cnt] = y, head[x] = cnt;
  next[++cnt] = head[y], to[cnt] = x, head[y] = cnt;
}
inline void Tarjan(int x, int father) {
  register int i;
  dfn[x] = low[x] = ++tot;
  stack[++top] = x;
  for (i = head[x]; i; i = next[i]) {
    if (to[i] == father) continue;
    if (!dfn[to[i]]) {
      Tarjan(to[i], x), low[x] = min(low[x], low[to[i]]);
    } else
      low[x] = min(low[x], dfn[to[i]]);
  }
  if (low[x] == dfn[x]) {
    int v;
    ++sum;
    maxx[sum] = minx[sum] = x;
    while (v = stack[top--], v != x)
      maxx[sum] = max(maxx[sum], v), minx[sum] = min(minx[sum], v);
  }
}
int main() {
  fseek(stdin, 0l, SEEK_END);
  register int flen = ftell(stdin);
  fseek(stdin, 0l, SEEK_SET);
  fread(buffer, 1, flen, stdin);
  ch = buffer;
  register int i;
  int x, y, l, r, mid;
  read(N), read(M);
  for (i = 1; i <= M; ++i) read(x), read(y), insert(x, y);
  for (i = 1; i <= N; ++i) To[i] = N;
  for (i = 1; i <= N; ++i)
    if (!dfn[i]) Tarjan(i, 0);
  for (i = 1; i <= sum; ++i)
    if (maxx[i] != minx[i]) To[minx[i]] = maxx[i] - 1;
  for (i = N - 1; i; --i) To[i] = min(To[i], To[i + 1]);
  for (i = 1; i <= N; ++i) Sum[i] = Sum[i - 1] + (To[i] - i + 1);
  read(Q);
  while (Q--) {
    read(x), read(y);
    l = x - 1, r = y + 1;
    while (l + 1 < r) {
      mid = (l + r) >> 1;
      if (To[mid] > y)
        r = mid;
      else
        l = mid;
    }
    ans = Sum[l] - Sum[x - 1] + 1ll * (y - l) * (y - l + 1) / 2;
    printf("%I64d\n", ans);
  }
  return 0;
}
