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>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const long long inf = 9.2e18;
const int maxn = 3e5 + 70;
const int INF = 2.1e9;
const int maxm = 1e6 + 70;
const int MOD = 1e9 + 7;
const double eps = 1e-7;
const double PI = acos(-1.0);
int n, m, k;
vector<int> G[maxn];
stack<pair<int, int> > S;
int low[maxn][20], high[maxn][20], f[maxn][20];
int r[maxn], d[maxn], sz[maxn];
long long pre[maxn];
int vis[maxn], dfs_clock, num;
void dfs(int u, int fa) {
  vis[u] = ++dfs_clock;
  sz[u] = 1;
  if (fa != -1) d[u] = d[fa] + 1;
  f[u][0] = fa;
  low[u][0] = min(u, fa);
  high[u][0] = max(u, fa);
  for (int i = 1; i < 20; i++) {
    f[u][i] = f[f[u][i - 1]][i - 1];
    low[u][i] = min(low[u][i - 1], low[f[u][i - 1]][i - 1]);
    high[u][i] = max(high[u][i - 1], high[f[u][i - 1]][i - 1]);
    if (f[u][i] == -1) break;
  }
  for (int i = 0; i < G[u].size(); i++) {
    if (G[u][i] != fa) {
      int v = G[u][i];
      if (!vis[v]) {
        dfs(v, u);
        sz[u] += sz[v];
      } else if (vis[v] < vis[u]) {
        num++;
        if (n < 2e5) S.push(make_pair(u, v));
      }
    }
  }
}
void dfs2(int u, int fa) {
  vis[u] = 1;
  sz[u] = 1;
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i];
    if (!vis[v]) {
      dfs(v, u);
      sz[u] += sz[v];
    }
  }
}
int main() {
  while (cin >> n >> m) {
    for (int i = 0; i <= n; i++) G[i].clear();
    for (int i = 0; i < m; i++) {
      int u, v;
      scanf("%d%d", &u, &v);
      G[u].push_back(v);
      G[v].push_back(u);
    }
    num = 0;
    while (!S.empty()) S.pop();
    memset(vis, 0, sizeof(vis));
    for (int i = 0; i <= n; i++) r[i] = INF;
    for (int i = 1; i <= n; i++) {
      if (!vis[i]) {
        dfs_clock = 0;
        d[i] = 0;
        dfs(i, -1);
      }
    }
    if (n > 2e5) cout << "backedges: " << num << endl;
    while (!S.empty()) {
      int u = S.top().first, v = S.top().second;
      S.pop();
      int l = INF, h = 0, k = 0;
      while ((1 << (k + 1)) <= d[u]) k++;
      int t = u;
      while (t != v) {
        if (d[f[t][k]] >= d[v]) {
          l = min(l, low[t][k]);
          h = max(h, high[t][k]);
          t = f[t][k];
        }
        k--;
      }
      r[l] = min(r[l], h);
    }
    while (!S.empty()) S.pop();
    for (int i = 1; i <= n; i++) {
      if (r[i] != INF) {
        if (!S.empty() && r[i] < S.top().second) S.pop();
        S.push(make_pair(i, r[i]));
      }
    }
    int b = INF, p = n;
    while (!S.empty()) {
      int x = S.top().first, y = S.top().second;
      S.pop();
      while (p > x) {
        r[p--] = b;
      }
      b = y;
    }
    while (p >= 1) r[p--] = b;
    pre[0] = 0;
    for (int i = 1; i <= n; i++) {
      if (r[i] == INF) break;
      pre[i] = pre[i - 1] + (r[i] - i);
    }
    int q;
    cin >> q;
    while (q--) {
      int a, b;
      scanf("%d%d", &a, &b);
      int L = a, R = b;
      while (L < R) {
        int M = L + (R - L) / 2;
        if (r[M] <= b)
          L = M + 1;
        else
          R = M;
      }
      long long t = b - L + 1;
      long long ans = t * (t + 1) / 2 + pre[L - 1] - pre[a - 1];
      cout << ans << endl;
    }
  }
  return 0;
}
