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;
long long n, m, q, ans, rightEnd[300010], pref[300010], inTime[300010],
    outTime[300010], t;
stack<long long> st;
vector<vector<long long> > gr;
void dfs(long long x, long long par) {
  ++t;
  inTime[x] = t;
  st.push(x);
  for (auto i : gr[x]) {
    if (i == par) {
      continue;
    }
    if (!outTime[i] and inTime[i] and inTime[x] > inTime[i]) {
      long long tmpMin = i, tmpMax = i;
      while (!st.empty()) {
        long long tmp = st.top();
        tmpMin = min(tmpMin, tmp);
        tmpMax = max(tmpMax, tmp);
        st.pop();
        if (tmp == i) {
          break;
        }
      }
      rightEnd[tmpMin] = tmpMax;
    } else if (!inTime[i]) {
      dfs(i, x);
    }
  }
  ++t;
  outTime[x] = t;
  if (!st.empty() and st.top() == x) {
    st.pop();
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  cin >> n >> m;
  gr.resize(n + 1, vector<long long>());
  for (long long i = 0; i < m; ++i) {
    long long x, y;
    cin >> x >> y;
    gr[x].push_back(y);
    gr[y].push_back(x);
  }
  for (long long i = 1; i <= n; ++i) {
    rightEnd[i] = n + 2;
  }
  for (long long i = 1; i <= n; ++i) {
    if (!inTime[i]) {
      dfs(i, -1);
    }
  }
  for (long long i = n - 1; i; --i) {
    rightEnd[i] = min(rightEnd[i + 1], rightEnd[i]);
  }
  for (long long i = 1; i <= n; ++i) {
    pref[i] = pref[i - 1] + rightEnd[i] - i;
  }
  cin >> q;
  while (q--) {
    long long l, r;
    cin >> l >> r;
    long long l1 = l, r1 = r, tmp = r;
    while (l1 <= r1) {
      long long mid = (l1 + r1) / 2;
      if (rightEnd[mid] > r) {
        r1 = mid - 1;
        tmp = mid;
      } else {
        l1 = mid + 1;
      }
    }
    ans = pref[tmp - 1] - pref[l - 1];
    ans += ((r - tmp + 1) * (r - tmp + 2)) / 2;
    cout << ans << '\n';
  }
}
