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, q, p[300005], dfn[300005], low[300005], Time = 0, sta[300005],
                                                  top = 0, tag[300005];
long long sum[300005];
bool insta[300005];
struct Edge {
  int to, next;
};
struct Graph {
  Edge edge[600005];
  int first[300005], le;
  Graph() {
    le = 2;
    memset(first, 0, sizeof(first));
  }
  void in(int x, int y) {
    Edge &e = edge[le];
    e.to = y;
    e.next = first[x];
    first[x] = le++;
  }
  void insert(int x, int y) {
    in(x, y);
    in(y, x);
  }
} g, bg;
void tarjan(int x, int fa) {
  dfn[x] = ++Time;
  low[x] = Time;
  sta[++top] = x;
  insta[x] = 1;
  for (int i = g.first[x]; i; i = g.edge[i].next) {
    const Edge &e = g.edge[i];
    if (e.to == fa) continue;
    if (!dfn[e.to]) {
      tarjan(e.to, x);
      low[x] = min(low[x], low[e.to]);
    } else if (insta[e.to])
      low[x] = min(low[x], dfn[e.to]);
  }
  if (dfn[x] == low[x]) {
    int Min = 0x3f3f3f3f, Max = 0;
    while (sta[top] != x) {
      Min = min(Min, sta[top]);
      Max = max(Max, sta[top]);
      insta[sta[top]] = 0;
      top--;
    }
    Min = min(Min, x);
    Max = max(Max, x);
    top--;
    insta[x] = 0;
    if (Min != Max) tag[Max] = max(tag[Max], Min);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 1, x, y; i <= m; i++) {
    cin >> x >> y;
    g.insert(x, y);
  }
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) tarjan(i, 0);
  int now = 0;
  for (int i = 1; i <= n; i++) {
    now = max(now, tag[i]);
    p[i] = now;
  }
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + p[i];
  cin >> q;
  while (q--) {
    int x, y;
    cin >> x >> y;
    int L = x, R = y + 1;
    while (L < R) {
      const int mid = (L + R) / 2;
      if (p[mid] >= x)
        R = mid;
      else
        L = mid + 1;
    }
    cout << -1ll * (x - 1) * (L - x) - (sum[y] - sum[L - 1]) +
                1ll * (x + y) * (y - x + 1) / 2
         << endl;
  }
  return 0;
}
