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 mod = (1e9) + 7;
const int siz = 3e5 + 5, siz2 = 5e1 + 5;
int n, m, q;
vector<int> adj[siz];
bool vis[siz], inst[siz];
vector<int> st;
int startp[siz], endp[siz];
long long cumu[siz];
void dfs(int i, int p) {
  if (inst[i]) {
    int mn = INT_MAX, mx = INT_MIN;
    for (int j = st.size() - 1;; j--) {
      mn = min(mn, st[j]);
      mx = max(mx, st[j]);
      if (st[j] == i) break;
    }
    startp[mx] = max(startp[mx], mn);
    return;
  }
  if (vis[i]) return;
  vis[i] = true;
  inst[i] = true;
  st.push_back(i);
  int sz = adj[i].size();
  for (int j = 0; j < sz; j++) {
    if (adj[i][j] != p) dfs(adj[i][j], i);
  }
  inst[i] = false;
  st.pop_back();
}
int main() {
  scanf("%d%d", &n, &m);
  while (m--) {
    int a, b;
    scanf("%d%d", &a, &b);
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  for (int i = 1; i <= n; i++) startp[i] = INT_MIN;
  for (int i = 1; i <= n; i++) dfs(i, 0);
  int lp = 1, rp = 1;
  while (lp <= n) {
    while (startp[rp] < lp) rp++;
    endp[lp] = rp - 1;
    lp++;
  }
  for (int i = 1; i <= n; i++) cumu[i] = endp[i] - i + 1 + cumu[i - 1];
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d%d", &l, &r);
    int le = l, ri = r + 1;
    while (le != ri) {
      int mid = (le + ri) / 2;
      if (endp[mid] >= r)
        ri = mid;
      else
        le = mid + 1;
    }
    long long ans = cumu[le - 1] - cumu[l - 1];
    if (le != r + 1) {
      long long term = r - le + 1;
      ans += (term * (term + 1)) / 2;
    }
    printf("%I64d\n", ans);
  }
  return 0;
}
