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;
typedef struct _Edge {
  int to;
  int next;
} Edge;
Edge arr[600010];
int head[300010], arrPt;
stack<int> stk;
bool hasVisited[300010], inStack[300010];
int pfxMaxMinPt[300010];
long long int pfxMaxMinPtSum[300010];
int vertexNum, edgeNum;
void addEdge(int from, int to) {
  arr[arrPt] = {to, head[from]};
  head[from] = arrPt++;
}
void dfs(int cntPt, int prevPt) {
  hasVisited[cntPt] = true;
  inStack[cntPt] = true;
  stk.push(cntPt);
  for (int i = head[cntPt]; i != -1; i = arr[i].next) {
    int nextPt = arr[i].to;
    if (nextPt == prevPt) continue;
    if (hasVisited[nextPt] && !inStack[nextPt]) continue;
    if (hasVisited[nextPt]) {
      int minPt = INT_MAX, maxPt = -1;
      while (!stk.empty()) {
        int cntTop = stk.top();
        stk.pop();
        inStack[cntTop] = false;
        minPt = min(minPt, cntTop);
        maxPt = max(maxPt, cntTop);
        if (cntTop == nextPt) break;
      }
      pfxMaxMinPt[maxPt] = max(pfxMaxMinPt[maxPt], minPt);
    } else {
      dfs(nextPt, cntPt);
    }
  }
  if (!stk.empty() && stk.top() == cntPt) {
    stk.pop();
    inStack[cntPt] = false;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(head, -1, sizeof(head));
  arrPt = 0;
  cin >> vertexNum >> edgeNum;
  for (int i = 0; i < edgeNum; i++) {
    int from, to;
    cin >> from >> to;
    from--, to--;
    addEdge(from, to);
    addEdge(to, from);
  }
  memset(inStack, false, sizeof(inStack));
  memset(hasVisited, false, sizeof(hasVisited));
  memset(pfxMaxMinPt, -1, sizeof(pfxMaxMinPt));
  memset(pfxMaxMinPtSum, 0, sizeof(pfxMaxMinPtSum));
  for (int i = 0; i < vertexNum; i++) {
    assert(stk.empty() == true);
    if (!hasVisited[i]) dfs(i, -1);
  }
  pfxMaxMinPtSum[0] = pfxMaxMinPt[0];
  for (int i = 1; i < vertexNum; i++) {
    pfxMaxMinPt[i] = max(pfxMaxMinPt[i], pfxMaxMinPt[i - 1]);
    pfxMaxMinPtSum[i] = pfxMaxMinPtSum[i - 1] + pfxMaxMinPt[i];
  }
  int qNum;
  cin >> qNum;
  while (qNum--) {
    int qLeftPt, qRightPt;
    cin >> qLeftPt >> qRightPt;
    qLeftPt--, qRightPt--;
    int pos = upper_bound(pfxMaxMinPt + qLeftPt, pfxMaxMinPt + qRightPt,
                          qLeftPt - 1) -
              (pfxMaxMinPt + qLeftPt);
    long long int ans =
        ((long long int)(qLeftPt + qRightPt) * (qRightPt - qLeftPt + 1)) >> 1;
    ans -= (long long int)(qLeftPt - 1) * pos + pfxMaxMinPtSum[qRightPt] -
           pfxMaxMinPtSum[qLeftPt + pos - 1];
    cout << ans << endl;
  }
  return 0;
}
