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 maxn = 3e5 + 500;
int n, m;
vector<int> G[maxn];
int visit[maxn] = {}, p[maxn] = {};
stack<int> st;
void dfs(int pos, int pre) {
  visit[pos] = 1;
  st.push(pos);
  for (int i : G[pos])
    if (i != pre) {
      if (visit[i] == 0) {
        dfs(i, pos);
      } else if (visit[i] == 1) {
        int mi = pos, ma = pos;
        while (!st.empty()) {
          int tp = st.top();
          st.pop();
          mi = min(mi, tp), ma = max(ma, tp);
          if (tp == i) break;
        }
        p[mi] = ma;
      }
    }
  visit[pos] = 2;
  if (!st.empty() && st.top() == pos) st.pop();
}
int bsearch(int l, int r, int val) {
  while (l < r) {
    int mid = (l + r + 1) >> 1;
    if (p[mid] > val) {
      r = mid - 1;
    } else
      l = mid;
  }
  return l;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i < n + 1; ++i) p[i] = n + 1;
  for (int i = 0; i < m; ++i) {
    int a, b;
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  for (int i = 1; i < n + 1; ++i)
    if (visit[i] != 2) {
      dfs(i, 0);
    }
  for (int i = n - 1; i >= 1; --i) {
    p[i] = min(p[i], p[i + 1]);
  }
  int q;
  cin >> q;
  while (q--) {
    unsigned long long a, b, lw, len, sum = 0;
    cin >> a >> b;
    while (1) {
      lw = bsearch(a, b, b);
      len = b - p[lw] + 1;
      if (p[lw] > b) {
        len = b - a + 1;
        sum += (len + 1) * len / 2;
        break;
      } else {
        sum += (len + 1) * len / 2 + len * (p[lw] - lw - 1);
        b = p[lw] - 1;
      }
    }
    cout << sum << '\n';
  }
}
