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 M = 3e5 + 5;
vector<int> vec[M];
int color[M];
long long segTree[4 * M], lazy[4 * M];
int lef[M], safe_left[M];
stack<int> stck;
vector<pair<int, int> > query[M];
long long answer[M];
void dfs(int u, int p) {
  color[u] = 1;
  stck.push(u);
  for (int i = 0; i < vec[u].size(); i++) {
    int v = vec[u][i];
    if (v == p || color[v] == 2) continue;
    if (color[v] == 0) {
      dfs(v, u);
    } else {
      int lo = M, hi = 0;
      while (stck.size()) {
        int x = stck.top();
        stck.pop();
        lo = min(lo, x);
        hi = max(hi, x);
        if (x == v) break;
      }
      lef[hi] = lo;
    }
  }
  if (stck.size() && stck.top() == u) stck.pop();
  color[u] = 2;
}
void push_down(int node, int l, int r) {
  segTree[node] += (r - l + 1) * lazy[node];
  if (l != r) {
    lazy[2 * node] += lazy[node];
    lazy[2 * node + 1] += lazy[node];
  }
  lazy[node] = 0;
}
void update(int node, int l, int r, int ql, int qr) {
  push_down(node, l, r);
  if (l > qr || l > r || r < ql) return;
  if (l >= ql && r <= qr) {
    lazy[node]++;
    push_down(node, l, r);
    return;
  }
  int mid = (l + r) / 2;
  update(2 * node, l, mid, ql, qr);
  update(2 * node + 1, mid + 1, r, ql, qr);
  segTree[node] = segTree[2 * node] + segTree[2 * node + 1];
}
long long ask(int node, int l, int r, int ql, int qr) {
  push_down(node, l, r);
  if (l > qr || l > r || r < ql) return 0;
  if (l >= ql && r <= qr) {
    return segTree[node];
  }
  int mid = (l + r) / 2;
  long long A = ask(2 * node, l, mid, ql, qr);
  long long B = ask(2 * node + 1, mid + 1, r, ql, qr);
  return (A + B);
}
int main() {
  int N, M;
  scanf("%d", &N);
  scanf("%d", &M);
  for (int i = 1; i <= M; i++) {
    int u, v;
    scanf("%d", &u);
    scanf("%d", &v);
    vec[u].push_back(v);
    vec[v].push_back(u);
  }
  for (int i = 1; i <= N; i++) {
    if (color[i]) continue;
    dfs(i, 0);
  }
  int till = 0;
  for (int i = 1; i <= N; i++) {
    till = max(till, lef[i]);
    safe_left[i] = till + 1;
  }
  int Q;
  scanf("%d", &Q);
  for (int i = 1; i <= Q; i++) {
    int L, R;
    scanf("%d", &L);
    scanf("%d", &R);
    query[R].push_back(make_pair(L, i));
  }
  for (int i = 1; i <= N; i++) {
    int lef_limit = safe_left[i];
    update(1, 1, N, lef_limit, i);
    for (int j = 0; j < query[i].size(); j++) {
      int LL = query[i][j].first;
      int RR = i;
      answer[query[i][j].second] = ask(1, 1, N, LL, RR);
    }
  }
  for (int i = 1; i <= Q; i++) {
    printf("%lld\n", answer[i]);
  }
}
