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;
vector<int> g[300010];
int n, m, q;
vector<pair<int, int> > que[300010];
int vis[300010], l[300010];
long long ans[300010];
stack<int> second;
void dfs(int u, int fa) {
  second.push(u);
  vis[u] = 1;
  for (int v : g[u])
    if (v != fa) {
      if (!vis[v])
        dfs(v, u);
      else if (vis[v] == 1) {
        int mi = 300010, mx = 0;
        while (!second.empty()) {
          int w = second.top();
          second.pop();
          mi = min(mi, w);
          mx = max(mx, w);
          if (w == v) break;
        }
        l[mx] = mi;
      }
    }
  if (!second.empty() && second.top() == u) second.pop();
  vis[u] = 2;
}
long long sum[300010 << 2], tg[300010];
void push_up(int o) { sum[o] = sum[o << 1] + sum[o << 1 | 1]; }
void push_down(int l, int r, int o) {
  if (!tg[o]) return;
  int m = (l + r) >> 1;
  sum[o << 1] += (m - l + 1) * tg[o], sum[o << 1 | 1] += (r - m) * tg[o];
  tg[o << 1] += tg[o], tg[o << 1 | 1] += tg[o];
  tg[o] = 0;
}
void update(int l, int r, int o, int ql, int qr, int d) {
  if (ql <= l && r <= qr) {
    sum[o] += (r - l + 1) * d, tg[o] += d;
    return;
  }
  push_down(l, r, o);
  int m = (l + r) >> 1;
  if (ql <= m) update(l, m, o << 1, ql, qr, d);
  if (qr > m) update(m + 1, r, o << 1 | 1, ql, qr, d);
  push_up(o);
}
long long query(int l, int r, int o, int ql, int qr) {
  if (ql <= l && r <= qr) return sum[o];
  push_down(l, r, o);
  long long ret = 0;
  int m = (l + r) >> 1;
  if (ql <= m) ret += query(l, m, o << 1, ql, qr);
  if (qr > m) ret += query(m + 1, r, o << 1 | 1, ql, qr);
  return ret;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    g[x].push_back(y), g[y].push_back(x);
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i, 0);
  int mx = 0;
  for (int i = 1; i <= n; i++) {
    mx = max(mx, l[i]);
    l[i] = mx + 1;
  }
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    que[r].push_back(make_pair(i, l));
  }
  for (int i = 1; i <= n; i++) {
    update(1, n, 1, l[i], i, 1);
    for (pair<int, int> v : que[i]) ans[v.first] = query(1, n, 1, v.second, i);
  }
  for (int i = 1; i <= q; i++) printf("%I64d\n", ans[i]);
  return 0;
}
