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 INF = 0x3f3f3f3f;
const int mod = 1500000001;
const int maxn = 3e5 + 7;
const double pi = acos(-1.0);
const int v2 = (mod + 1) / 2;
const double eps = 1e-7;
int n, m, l[maxn], r[maxn], cnt, maxl[maxn], pos[maxn], dfn[maxn], low[maxn],
    vis[maxn], num;
stack<int> sta;
long long sum[maxn];
vector<int> g[maxn];
void dfs(int now, int fa) {
  dfn[now] = low[now] = ++num;
  sta.push(now);
  for (int i = 0; i < g[now].size(); i++) {
    int to = g[now][i];
    if (to == fa) continue;
    if (!dfn[to]) {
      dfs(to, now);
      low[now] = min(low[now], low[to]);
    } else {
      low[now] = min(low[now], dfn[to]);
    }
  }
  if (dfn[now] == low[now]) {
    ++cnt;
    int u;
    int _ = 0;
    do {
      u = sta.top();
      l[cnt] = min(l[cnt], u);
      r[cnt] = max(r[cnt], u);
      _++;
      sta.pop();
    } while (sta.size() && u != now);
    if (_ == 1) cnt--;
  }
}
void init() {
  memset(maxl, 0, sizeof(maxl));
  for (int i = 0; i <= cnt; i++) {
    maxl[r[i]] = max(maxl[r[i]], l[i]);
  }
  for (int i = 1; i <= n; i++) {
    maxl[i] = max(maxl[i], maxl[i - 1]);
  }
  for (int i = n; i > maxl[n]; i--) pos[i] = n + 1;
  for (int i = 1; i <= n; i++) {
    for (int j = maxl[i]; j > maxl[i - 1]; j--) pos[j] = i;
  }
  sum[0] = 0;
  for (int i = 1; i <= n; i++) {
    sum[i] = sum[i - 1] + 1ll * (i - maxl[i]);
  }
}
long long solve(int a, int b) {
  int p = pos[--a];
  if (p <= a) {
    return sum[b] - sum[a];
  } else if (p > a && p <= b)
    return sum[b] - sum[p - 1] + 1ll * (p - a - 1) * (p - a) / 2;
  else
    return 1ll * (b - a + 1) * (b - a) / 2;
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i <= n; i++) vis[i] = 0, l[i] = n + 1, r[i] = 0;
  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    g[a].push_back(b);
    g[b].push_back(a);
  }
  cnt = -1;
  num = 0;
  for (int i = 1; i <= n; i++) {
    if (!dfn[i]) dfs(i, -1);
  }
  init();
  int q;
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    printf("%lld\n", solve(a, b));
  }
  return 0;
}
