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 N = 3e5 + 5;
int n, m, q, low[N], vis[N];
long long pre[N];
vector<int> es[N];
stack<int> stk;
void dfs(int u, int par) {
  stk.push(u);
  vis[u] = 1;
  for (auto v : es[u])
    if (v != par) {
      if (!vis[v])
        dfs(v, u);
      else if (vis[v] == 1) {
        int mn = v, mx = v;
        while (!stk.empty()) {
          int cur = stk.top();
          stk.pop();
          mn = min(mn, cur);
          mx = max(mx, cur);
          if (cur == v) break;
        }
        low[mx] = mn;
      }
    }
  if (!stk.empty() && stk.top() == u) stk.pop();
  vis[u] = 2;
}
void solve() {
  scanf("%d%d", &n, &m);
  for (int _ = 0; _ < m; _++) {
    int a, b;
    scanf("%d%d", &a, &b);
    es[a].push_back(b);
    es[b].push_back(a);
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i, 0);
  for (int i = 1; i <= n; i++) {
    low[i] = max(low[i], low[i - 1]);
    pre[i] = pre[i - 1] + i - low[i];
  }
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d%d", &l, &r);
    int lo = l, hi = r;
    while (lo < hi) {
      int mid = (lo + hi + 1) / 2;
      if (low[mid] < l)
        lo = mid;
      else
        hi = mid - 1;
    }
    printf("%lld\n", pre[r] - pre[lo] + 1ll * (lo - l + 1) * (lo - l + 2) / 2);
  }
}
int main() {
  solve();
  return 0;
}
