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 MAX = 300001;
int n, m;
vector<int> rightt(MAX, MAX + 10);
vector<vector<int> > adjList(MAX);
int UNVISITED = 0, EXPLORED = 1, VISITED = 2;
int visited[MAX];
stack<int> s;
void dfs(int node, int p) {
  s.push(node);
  visited[node] = EXPLORED;
  for (auto nxt : adjList[node])
    if (nxt != p) {
      if (!visited[nxt]) {
        dfs(nxt, node);
      } else if (visited[nxt] == EXPLORED) {
        int mn = MAX + 10, mx = -1;
        while (1) {
          int num = s.top();
          s.pop();
          mn = min(mn, num);
          mx = max(mx, num);
          if (num == nxt) break;
        }
        rightt[mn] = mx;
      }
    }
  visited[node] = VISITED;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  cin >> n >> m;
  while (m--) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    adjList[a].push_back(b);
    adjList[b].push_back(a);
  }
  for (int i = 0; i < n; i++)
    if (visited[i] == UNVISITED) dfs(i, -1);
  for (int i = n - 2; i >= 0; i--) rightt[i] = min(rightt[i], rightt[i + 1]);
  long long sumDiff[MAX + 1];
  sumDiff[0] = rightt[0];
  for (int i = 1; i < MAX; i++) sumDiff[i] = sumDiff[i - 1] + rightt[i] - i;
  int q;
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    l--, r--;
    auto ptr = upper_bound(rightt.begin() + l, rightt.begin() + r, r);
    if (ptr == rightt.end()) {
      cout << sumDiff[r] - (l == 0 ? 0 : sumDiff[l - 1]) << "\n";
    } else {
      int start = ptr - rightt.begin();
      cout << 1ll * (r - start + 1) * (r - start + 2) / 2 +
                  (start == 0 ? 0 : sumDiff[start - 1]) -
                  (l == 0 ? 0 : sumDiff[l - 1])
           << "\n";
    }
  }
}
