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>
#pragma comment(linker, "/STACK:536870912")
#pragma warning(disable : 4996)
using namespace std;
const int N = 3e5 + 100;
vector<int> v[N];
int sz[N], col[N], cs[N], rb[N];
long long int ans[N], sum[N];
bool used[N];
int z = 1;
pair<int, int> dfs(int node, int anc) {
  used[node] = 1;
  pair<int, int> ret = {-1, -1};
  for (int to : v[node]) {
    if (to == anc) continue;
    if (used[to]) {
      if (ret.first == -1) ret = {to, z++};
    } else {
      auto g = dfs(to, node);
      if (g.first != -1) ret = g;
    }
  }
  if (ret.first != -1) {
    sz[ret.second]++;
    col[node] = ret.second;
    return ret.first == node ? make_pair(-1, -1) : ret;
  }
  return {-1, -1};
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--, b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  for (int i = 0; i < n; i++) {
    if (!used[i]) {
      dfs(i, -1);
    }
  }
  int r = -1, t = 0;
  for (int i = 0; i < n; i++) {
    while (!t && r < n) {
      r++;
      if (col[r]) {
        cs[col[r]]++;
        if (cs[col[r]] == sz[col[r]]) t = 1;
      }
    }
    rb[i] = r - 1;
    if (col[i]) {
      if (cs[col[i]] == sz[col[i]]) t = 0;
      cs[col[i]]--;
    }
  }
  for (int i = 0; i < n; i++) {
    sum[i + 1] = sum[i] + rb[i] - i + 1;
  }
  int q;
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--, y--;
    long long int w = upper_bound(rb, rb + n, y) - rb - 1, h = y - w,
                  ans = sum[max((long long int)x, w + 1)] - sum[x] +
                        h * (h + 1) / 2;
    printf("%lld\n", ans);
  }
  return 0;
}
