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<int> graph[300030];
long long to[300030], sum[300030];
int parent[300030], cnt[300030];
int getParent(int x) {
  if (x == parent[x]) return x;
  return parent[x] = getParent(parent[x]);
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  for (int i = 1; i <= n; i++) parent[i] = i;
  int e = 1;
  for (int i = 1; i <= n; i++) {
    to[i] = ((e) < (n) ? (e) : (n));
    while (++e <= n) {
      bool flag = true;
      for (int v : graph[e]) {
        if (i <= v && v <= e) {
          int p = getParent(v);
          cnt[p]++;
          if (cnt[p] > 1) flag = false;
        }
      }
      for (int v : graph[e]) {
        if (i <= v && v <= e) {
          int p = getParent(v);
          cnt[p]--;
          if (flag) {
            parent[v] = e;
          }
        }
      }
      if (flag) {
        to[i] = e;
      } else {
        --e;
        break;
      }
    }
    sum[i] = sum[i - 1] + to[i];
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    long long x, y;
    scanf("%lld%lld", &x, &y);
    long long l, r, pos = x - 1;
    l = x;
    r = y;
    while (l <= r) {
      long long m = (l + r) >> 1;
      if (to[m] <= y) {
        pos = m;
        l = m + 1;
      } else {
        r = m - 1;
      }
    }
    long long l1 = pos - x + 1;
    long long l2 = y - pos;
    printf("%lld\n", sum[pos] - sum[x - 1] - l1 * (l1 - 1) / 2 - (x - 1) * l1 +
                         l2 * (l2 + 1) / 2);
  }
  return 0;
}
