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;
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
vector<int> adj[300009];
vector<pair<int, int> > add[300009];
int sz[300009], comp[300009], S;
int tin[300009], fup[300009], TIM, arr[300009], cnt[300009];
stack<int> st;
long long ans[300009];
void dfs(int nd, int pr) {
  tin[nd] = fup[nd] = ++TIM;
  st.push(nd);
  for (int i = 0; i < int(adj[nd].size()); i++) {
    int to = adj[nd][i];
    if (to == pr) continue;
    if (!tin[to]) {
      dfs(to, nd);
      umin(fup[nd], fup[to]);
    } else
      umin(fup[nd], tin[to]);
  }
  if (fup[nd] == tin[nd]) {
    int aux;
    S++;
    do {
      aux = st.top();
      st.pop();
      comp[aux] = S;
      sz[S]++;
    } while (aux != nd);
  }
}
long long s[300009 << 2];
int lazy[300009 << 2];
void shift(int nd, int x, int y) {
  int& ret = lazy[nd];
  if (!ret) return;
  int mid = (x + y) >> 1;
  s[nd << 1] += (mid - x + 1) * 1LL * ret;
  lazy[nd << 1] += ret;
  s[nd << 1 | 1] += (y - mid) * 1LL * ret;
  lazy[nd << 1 | 1] += ret;
  ret = 0;
}
void inc(int l, int r, int nd, int x, int y) {
  if (l > y or x > r) return;
  if (l <= x and y <= r) {
    lazy[nd]++;
    s[nd] += (y - x + 1);
    return;
  }
  shift(nd, x, y);
  int mid = (x + y) >> 1;
  inc(l, r, nd << 1, x, mid);
  inc(l, r, nd << 1 | 1, mid + 1, y);
  s[nd] = s[nd << 1] + s[nd << 1 | 1];
}
long long tap(int l, int r, int nd, int x, int y) {
  if (l > y or x > r) return 0;
  if (l <= x and y <= r) return s[nd];
  shift(nd, x, y);
  int mid = (x + y) >> 1;
  return tap(l, r, nd << 1, x, mid) + tap(l, r, nd << 1 | 1, mid + 1, y);
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  while (m--) {
    int u, v;
    scanf("%d%d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 1; i <= n; i++)
    if (!tin[i]) dfs(i, -1);
  int p = 1;
  for (int i = 1; i <= n; i++) {
    if (sz[comp[i]] > 1) {
      cnt[comp[i]]++;
      while (cnt[comp[i]] == sz[comp[i]]) cnt[comp[p]]--, p++;
    }
    arr[i] = p;
  }
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    add[r].push_back(make_pair(l, i));
  }
  for (int i = 1; i <= n; i++) {
    inc(arr[i], i, 1, 1, n);
    for (__typeof((add[i]).begin()) it = (add[i]).begin(); it != (add[i]).end();
         it++)
      ans[it->second] = tap(it->first, i, 1, 1, n);
  }
  for (int i = 1; i <= q; i++) printf("%lld\n", ans[i]);
  return 0;
}
