#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);
  }
}
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;
    node[u].push_back({v, i + 1});
    node[v].push_back({u, i + 1});
  }
  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]] && beg[have[i]] != 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;
}
