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 black = 0, white = 1, grey = 2;
vector<int> find_cycles(const vector<vector<int>>& adj_list);
int main() {
  std::ios::sync_with_stdio(false);
  int nodes, edges;
  cin >> nodes >> edges;
  vector<vector<int>> adj_list(nodes);
  for (int i = 0; i < edges; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    adj_list[a].push_back(b);
    adj_list[b].push_back(a);
  }
  vector<int> first_bad = find_cycles(adj_list);
  vector<long long> good_sums(nodes + 1);
  for (int i = 0; i < nodes; i++)
    good_sums[i + 1] = good_sums[i] + first_bad[i] - i;
  int queries;
  cin >> queries;
  for (int i = 0; i < queries; i++) {
    int left, right;
    cin >> left >> right;
    left--;
    right--;
    auto end = first_bad.begin() + (right + 1);
    auto bound = upper_bound(first_bad.begin() + left, end, right);
    int good = bound - (first_bad.begin() + left);
    long long bad = right - left + 1 - good;
    long long first_part = good_sums[left + good] - good_sums[left];
    long long second_part = bad * (bad + 1) / 2;
    cout << first_part + second_part << '\n';
  }
}
pair<int, int> find_cycle(const vector<int>& stack, int stop) {
  int i = stack.size() - 1;
  int maximum = stop, minimum = stop;
  while (stack[i] != stop) {
    maximum = max(maximum, stack[i]);
    minimum = min(minimum, stack[i]);
    i--;
  }
  return make_pair(minimum, maximum);
}
void dfs(int node, const vector<vector<int>>& adj_list, vector<int>& color,
         vector<int>& first_bad, vector<int>& stack) {
  stack.push_back(node);
  color[node] = grey;
  for (int i = 0; i < adj_list[node].size(); i++) {
    int next = adj_list[node][i];
    if (color[next] == black)
      dfs(next, adj_list, color, first_bad, stack);
    else if (color[next] == grey && next != stack[stack.size() - 2]) {
      pair<int, int> cycle_edges = find_cycle(stack, next);
      first_bad[cycle_edges.first] = cycle_edges.second;
    }
  }
  color[node] = white;
  stack.pop_back();
}
vector<int> find_cycles(const vector<vector<int>>& adj_list) {
  vector<int> color(adj_list.size(), black),
      first_bad(adj_list.size(), adj_list.size());
  vector<int> stack;
  for (int i = 0; i < adj_list.size(); i++)
    if (color[i] == black) dfs(i, adj_list, color, first_bad, stack);
  for (int i = adj_list.size() - 2; i >= 0; i--)
    first_bad[i] = min(first_bad[i], first_bad[i + 1]);
  return first_bad;
}
