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 = 3e5 + 10;
vector<int> G[maxn];
int dfn[maxn], coc;
stack<int> s;
bool ins[maxn];
int bel[maxn], blo;
int crash[maxn][2];
int tarjan(int u, int f) {
  int lowu = dfn[u] = ++coc;
  ins[u] = true;
  s.push(u);
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i];
    if (v == f) continue;
    if (!dfn[v]) {
      int lowv = tarjan(v, u);
      lowu = min(lowv, lowu);
    } else if (ins[v])
      lowu = min(lowu, dfn[v]);
  }
  if (lowu == dfn[u]) {
    crash[blo][0] = crash[blo][1] = u;
    int size = 0;
    while (ins[u]) {
      int v = s.top();
      s.pop();
      size++;
      ins[v] = false;
      bel[v] = blo;
      crash[blo][0] = min(crash[blo][0], v);
      crash[blo][1] = max(crash[blo][1], v);
    }
    if (size != 1) blo++;
  }
  return lowu;
}
set<int> lp;
vector<int> rp[maxn];
int maxr[maxn];
pair<int, int> query[maxn];
int id[maxn];
int ans[maxn];
bool cmp(int x, int y) { return (query[x] > query[y]); }
namespace Seg {
long long sum[maxn << 2], all[maxn << 2];
void updata(int p, int l, int r, int lq, int rq, long long v) {
  if (l == lq && r == rq) return void(all[p] += v);
  sum[p] += (rq - lq + 1) * v;
  int mid = l + r >> 1;
  if (rq <= mid)
    updata((p << 1), l, mid, lq, rq, v);
  else if (lq > mid)
    updata((p << 1 | 1), mid + 1, r, lq, rq, v);
  else
    updata((p << 1), l, mid, lq, mid, v),
        updata((p << 1 | 1), mid + 1, r, mid + 1, rq, v);
}
long long query(int p, int l, int r, int lq, int rq) {
  long long rtn = all[p] * (rq - lq + 1);
  if (l == lq && r == rq) return rtn + sum[p];
  int mid = l + r >> 1;
  if (rq <= mid)
    return query((p << 1), l, mid, lq, rq) + rtn;
  else if (lq > mid)
    return query((p << 1 | 1), mid + 1, r, lq, rq) + rtn;
  else
    return query((p << 1), l, mid, lq, mid) + rtn +
           query((p << 1 | 1), mid + 1, r, mid + 1, rq);
}
}  // namespace Seg
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  while (m--) {
    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 (!dfn[i]) tarjan(i, 0);
  for (int i = 0; i < blo; i++) {
    rp[crash[i][0]].push_back(crash[i][1]);
    lp.insert(crash[i][1]);
  }
  for (int i = 1; i <= n; i++) {
    maxr[i] = lp.size() ? *lp.begin() - 1 : n;
    for (int j = 0; j < rp[i].size(); j++) lp.erase(rp[i][j]);
  }
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; i++)
    scanf("%d%d", &query[i].first, &query[i].second), id[i] = i;
  sort(id + 1, id + 1 + q, cmp);
  int minl = n + 1;
  for (int i = 1; i <= q; i++) {
    while (minl > query[id[i]].first)
      Seg::updata(1, 1, n, minl - 1, maxr[minl - 1], 1), --minl;
    ans[id[i]] = Seg::query(1, 1, n, query[id[i]].first, query[id[i]].second);
  }
  for (int i = 1; i <= q; i++) printf("%d\n", ans[i]);
}
