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;
vector<array<long long int, 2>> lr_seg;
bool cmp(array<long long int, 2> a, array<long long int, 2> b) {
  if (a[0] != b[0]) {
    return a[0] < b[0];
  }
  return a[1] < b[1];
}
bool vis[300003];
vector<long long int> v;
vector<long long int> g[300003];
long long int mn_right[300003];
long long int ans[300003];
void dfs(long long int node, long long int parent) {
  vis[node] = 1;
  v.push_back(node);
  for (auto it : g[node]) {
    if (it == parent) {
      continue;
    }
    if (vis[it]) {
      long long int Mn = it;
      long long int Mx = it;
      for (long long int i = v.size() - 1ll; i >= 0 && v[i] != it; i--) {
        Mn = min(Mn, v[i]);
        Mx = max(Mx, v[i]);
      }
      lr_seg.push_back({Mn, Mx});
    }
    if (!vis[it]) {
      dfs(it, node);
    }
  }
  v.pop_back();
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m;
  cin >> n >> m;
  for (long long int i = 0; i < m; i++) {
    long long int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  for (long long int i = 1; i <= n; i++) {
    if (!vis[i]) {
      dfs(i, 0);
    }
  }
  sort(lr_seg.begin(), lr_seg.end(), cmp);
  long long int cur = n + 1ll;
  for (long long int i = n; i >= 1; i--) {
    long long int indx = lower_bound(lr_seg.begin(), lr_seg.end(),
                                     array<long long int, 2>{i, 0}) -
                         lr_seg.begin();
    if (indx < lr_seg.size()) {
      cur = min(cur, lr_seg[indx][1]);
    }
    mn_right[i] = cur - 1ll;
  }
  for (long long int i = 1; i <= n; i++) {
    ans[i] = ans[i - 1ll] + (mn_right[i] - i + 1ll);
  }
  long long int q;
  cin >> q;
  while (q--) {
    long long int l, r;
    cin >> l >> r;
    long long int lo = l;
    long long int hi = r;
    long long int indx = n + 1ll;
    while (lo <= hi) {
      long long int mid = (lo + hi) / 2;
      if (mn_right[mid] > r) {
        indx = mid;
        hi = mid - 1ll;
      } else {
        lo = mid + 1ll;
      }
    }
    long long int res;
    if (indx == n + 1ll) {
      res = ans[r] - ans[l - 1ll];
    } else {
      res = ans[indx - 1ll] - ans[l - 1ll];
      res += ((r - indx + 1ll) * (r - indx + 2ll)) / 2;
    }
    cout << res << "\n";
  }
}
