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;
int n, m, curr = -1;
vector<int> adj[300001];
vector<int> st;
set<int> cycle[300001];
int lt[300001];
bool visited[300001], added[300001];
int bs(int l, int r) {
  int x = r, mid;
  while (l <= r) {
    mid = (l + r) / 2;
    if (lt[mid] < x)
      l = mid + 1;
    else
      r = mid - 1;
  }
  return l - 1;
}
void dfs(int node = 1, int pa = -1) {
  if (visited[node] && added[node]) {
    curr++;
    while (st.size() && st.back() != node) {
      cycle[curr].insert(st.back());
      added[st.back()] = true;
      st.pop_back();
    }
    st.pop_back();
    cycle[curr].insert(node);
    added[node] = true;
    return;
  }
  visited[node] = true;
  added[node] = true;
  for (auto it : adj[node]) {
    if (it == pa || (visited[it] && !added[it])) continue;
    if (st.size() == 0 || st.back() != node) st.push_back(node);
    dfs(it, node);
  }
  if (st.back() == node) st.pop_back();
  added[node] = false;
}
int main() {
  int a, b;
  scanf("%d %d", &n, &m);
  for (int i = 0; i < m; ++i) {
    scanf("%d %d", &a, &b);
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  for (int i = 1; i <= n; ++i)
    if (!visited[i]) dfs(i);
  for (int i = 1; i <= n; ++i) lt[i] = n;
  for (int i = 0; i <= curr; ++i) {
    set<int>::iterator it = cycle[i].begin();
    set<int>::iterator it2 = cycle[i].end();
    it2--;
    lt[*it] = (*it2) - 1;
    it++;
    while (it != cycle[i].end()) {
      lt[*it] = n;
      it++;
    }
  }
  lt[n] = n;
  for (int i = n - 1; i > 0; --i) lt[i] = min(lt[i], lt[i + 1]);
  vector<long long> presum(n + 1, 0);
  for (int i = 1; i <= n; ++i) {
    presum[i] = presum[i - 1] + (long long)lt[i] - (long long)i + 1LL;
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d %d", &l, &r);
    int rig = bs(l, r);
    long long ans = presum[rig] - presum[l - 1];
    long long temp = ((long long)r * ((long long)r + 1LL)) / 2LL;
    temp -= (((long long)rig + 1LL) * ((long long)rig)) / 2LL;
    ans += (long long)r * ((long long)r - (long long)rig) - temp +
           ((long long)r - (long long)rig);
    printf("%lld\n", ans);
  }
}
