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;
const int maxn = 300005;
const double eps = 1e-10;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
vector<int> g[maxn];
int st[maxn], top = 0, now = 0, dfn[maxn], low[maxn], p[maxn], sum[maxn];
bool vis[maxn];
void tarjan(int x, int fa) {
  st[++top] = x;
  vis[x] = 1;
  dfn[x] = low[x] = ++now;
  for (int i = 0; i < g[x].size(); i++) {
    int v = g[x][i];
    if (v == fa) continue;
    if (!dfn[v]) {
      tarjan(v, x);
      low[x] = min(low[x], low[v]);
    } else if (vis[v])
      low[x] = min(low[x], dfn[v]);
  }
  if (low[x] == dfn[x]) {
    int v, mn = 1e9, mx = 0;
    do {
      v = st[top];
      mn = min(mn, v);
      mx = max(mx, v);
      vis[v] = 0;
      top--;
    } while (x != v);
    p[mn] = mx;
  }
}
int main() {
  int n = read(), m = read();
  for (int i = 1, u, v; i <= m; i++) {
    u = read(), v = read();
    g[u].push_back(v);
    g[v].push_back(u);
  }
  for (int i = 1; i <= n + 1; i++) p[i] = n + 1;
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) tarjan(i, 0);
  sum[n + 1] = 0;
  for (int i = n; i >= 1; i--) {
    p[i] = min(p[i], p[i + 1]);
    sum[i] = sum[i + 1] + p[i] - i;
  }
  int q = read();
  while (q--) {
    int x = read(), y = read();
    int l = x, r = y, ans = x;
    while (l <= r) {
      int mid = l + r >> 1;
      if (p[mid] <= y)
        l = mid + 1;
      else
        ans = mid, r = mid - 1;
    }
    printf("%I64d\n",
           sum[x] - sum[ans] + 1LL * (y - ans + 2) * (y - ans + 1) / 2);
  }
}
