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;
constexpr int N = 3e5 + 10;
long long n, m, u, v, p, have[N], g = 1, q[N], tree[4 * N], lazy[4 * N], ans[N],
                                  qu, beg[N];
vector<pair<int, int>> node[N], zz[N];
vector<int> adj[N], badj[N], vec;
bool mark[N], tof[N];
void dfs(int v) {
  mark[v] = true;
  for (auto i : node[v]) {
    if (!tof[i.second]) {
      adj[v].push_back(i.first);
      badj[i.first].push_back(v);
      tof[i.second] = true;
    }
    if (!mark[i.first]) dfs(i.first);
  }
}
void dfs2(int v) {
  mark[v] = true;
  for (auto i : adj[v])
    if (!mark[i]) dfs2(i);
  vec.push_back(v);
}
void dfs3(int v) {
  mark[v] = true;
  q[p]++;
  have[v] = p;
  for (auto i : badj[v]) {
    if (!mark[i]) dfs3(i);
  }
}
bool cmp(int &lhs, int &rhs) { return rhs < lhs; }
void shift(int b, int e, int idx) {
  int mid = (b + e) >> 1;
  int lidx = idx << 1, ridx = lidx | 1;
  lazy[lidx] += lazy[idx];
  lazy[ridx] += lazy[idx];
  tree[lidx] += (mid - b) * lazy[idx];
  tree[ridx] += (e - mid) * lazy[idx];
  lazy[idx] = 0;
}
void update(int b, int e, int l, int r, int idx) {
  if (b >= r || e <= l) return;
  if (b >= l && e <= r) {
    tree[idx] += (e - b);
    lazy[idx]++;
    return;
  }
  int mid = (b + e) >> 1, lidx = idx << 1, ridx = lidx | 1;
  shift(b, e, idx);
  update(b, mid, l, r, lidx);
  update(mid, e, l, r, ridx);
  tree[idx] = tree[lidx] + tree[ridx];
}
long long query(int b, int e, int l, int r, int idx) {
  if (b >= r || e <= l) return 0;
  if (b >= l && e <= r) return tree[idx];
  int mid = (b + e) >> 1, lidx = idx << 1, ridx = lidx | 1;
  shift(b, e, idx);
  return query(b, mid, l, r, lidx) + query(mid, e, l, r, ridx);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> u >> v;
    p++;
    node[u].push_back({v, p});
    node[v].push_back({u, p});
  }
  memset(have, -1, sizeof(have));
  for (int i = 1; i <= n; i++) {
    if (!mark[i]) dfs(i);
  }
  memset(mark, 0, sizeof(mark));
  for (int i = 1; i <= n; i++) {
    if (!mark[i]) {
      dfs2(i);
    }
  }
  memset(mark, 0, sizeof(mark));
  p = 0;
  for (int i = (int)vec.size() - 1; ~i; i--) {
    if (!mark[vec[i]]) {
      dfs3(vec[i]);
      p++;
    }
  }
  cin >> qu;
  for (int i = 0; i < qu; i++) {
    cin >> u >> v;
    zz[v].push_back({i, u});
  }
  for (int i = 1; i <= n; i++) {
    if (have[i] != -1) {
      if (!beg[have[i]]) beg[have[i]] = i;
      q[have[i]]--;
      if (!q[have[i]]) g = max(g, beg[have[i]] + 1);
    }
    update(1, n + 1, g, i + 1, 1);
    while ((int)zz[i].size()) {
      ans[(zz[i].back()).first] =
          query(1, n + 1, (zz[i].back()).second, i + 1, 1);
      zz[i].pop_back();
    }
  }
  for (int i = 0; i < qu; i++) cout << ans[i] << '\n';
  return 0;
}
