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, id[300011], bcc = 1;
int num[300011], low[300011], st[300011];
int Q, q[300011][2];
long long csum, inc1, inc2, change[300011], ans[300011];
priority_queue<pair<int, int> > pq1;
priority_queue<pair<int, int> > pq2;
vector<int> adj[300011];
stack<int> stdfs;
priority_queue<pair<int, int> > rnge;
struct segtree {
  long long data[4 * 300011], lazy[4 * 300011];
  void push(int w, int L, int R) {
    if (!lazy[w])
      return;
    else if (L != R) {
      lazy[w * 2] += lazy[w];
      lazy[w * 2 + 1] += lazy[w];
    }
    data[w] += lazy[w] * 1LL * (R - L + 1);
    lazy[w] = 0;
  }
  void update(int w, int L, int R, int a, int b, int v) {
    push(w, L, R);
    if (b < L || a > R)
      return;
    else if (a <= L && b >= R) {
      lazy[w] += v;
      push(w, L, R);
    } else {
      update(w * 2, L, (L + R) / 2, a, b, v);
      update(w * 2 + 1, (L + R) / 2 + 1, R, a, b, v);
      data[w] = data[w * 2] + data[w * 2 + 1];
    }
  }
  long long query(int w, int L, int R, int a, int b) {
    push(w, L, R);
    if (b < L || a > R)
      return 0;
    else if (a <= L && b >= R)
      return data[w];
    else {
      long long q1 = query(w * 2, L, (L + R) / 2, a, b);
      long long q2 = query(w * 2 + 1, (L + R) / 2 + 1, R, a, b);
      return q1 + q2;
    }
  }
} tree;
void dfs(int x, int p) {
  static int cnt = 0;
  bool isAp = false;
  stdfs.push(x);
  num[x] = low[x] = (++cnt);
  for (int i = 0; i < (int)adj[x].size(); i++) {
    int nxt = adj[x][i];
    if (nxt == p) continue;
    if (!num[nxt]) {
      dfs(nxt, x);
      isAp |= (low[nxt] >= num[x]);
    }
    low[x] = min(low[x], low[nxt]);
  }
  if (num[x] == low[x]) {
    pair<int, int> cur(((1 << 29) + 123), -((1 << 29) + 123));
    while (stdfs.size() && num[stdfs.top()] >= num[x]) {
      cur.first = min(cur.first, stdfs.top());
      cur.second = max(cur.second, stdfs.top());
      id[stdfs.top()] = bcc;
      stdfs.pop();
    }
    if (cur.second != cur.first) st[cur.second] = cur.first;
    bcc++;
  }
}
int main() {
  if (fopen("data.in", "r")) freopen("data.in", "r", stdin);
  scanf("%d", &N);
  scanf("%d", &M);
  for (int i = 0; i < M; i++) {
    int a, b;
    scanf("%d", &a);
    scanf("%d", &b);
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  for (int i = 1; i <= N; i++)
    if (!num[i]) dfs(i, i);
  scanf("%d", &Q);
  for (int i = 0; i < Q; i++) {
    scanf("%d %d", &q[i][0], &q[i][1]);
    pq1.push(make_pair(-q[i][0], i));
  }
  for (int l = 1, r = 1; l <= N; l++) {
    while (pq1.size() && -pq1.top().first == l) {
      int id = pq1.top().second;
      pq1.pop();
      pq2.push(make_pair(-q[id][1], id));
      ans[id] = -tree.query(1, 1, N, q[id][0], q[id][1]);
    }
    while (r <= N && st[r] < l) r++;
    tree.update(1, 1, N, l, r - 1, 1);
    while (pq2.size() && -pq2.top().first == l) {
      int id = pq2.top().second;
      pq2.pop();
      ans[id] += tree.query(1, 1, N, q[id][0], q[id][1]);
    }
  }
  for (int i = 0; i < Q; i++) {
    printf("%I64d\n", ans[i]);
  }
  return 0;
}
