You are given an undirected graph with n vertices. There are no edge-simple cycles with the even length in it. In other words, there are no cycles of even length that pass each edge at most once. Let's enumerate vertices from 1 to n. 

You have to answer q queries. Each query is described by a segment of vertices [l; r], and you have to count the number of its subsegments [x; y] (l ≤ x ≤ y ≤ r), such that if we delete all vertices except the segment of vertices [x; y] (including x and y) and edges between them, the resulting graph is bipartite.

Input

The first line contains two integers n and m (1 ≤ n ≤ 3·105, 1 ≤ m ≤ 3·105) — the number of vertices and the number of edges in the graph.

The next m lines describe edges in the graph. The i-th of these lines contains two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi), denoting an edge between vertices ai and bi. It is guaranteed that this graph does not contain edge-simple cycles of even length.

The next line contains a single integer q (1 ≤ q ≤ 3·105) — the number of queries.

The next q lines contain queries. The i-th of these lines contains two integers li and ri (1 ≤ li ≤ ri ≤ n) — the query parameters.

Output

Print q numbers, each in new line: the i-th of them should be the number of subsegments [x; y] (li ≤ x ≤ y ≤ ri), such that the graph that only includes vertices from segment [x; y] and edges between them is bipartite.

Examples

Input

6 6
1 2
2 3
3 1
4 5
5 6
6 4
3
1 3
4 6
1 6


Output

5
5
14


Input

8 9
1 2
2 3
3 1
4 5
5 6
6 7
7 8
8 4
7 2
3
1 8
1 4
3 8


Output

27
8
19

Note

The first example is shown on the picture below:

<image>

For the first query, all subsegments of [1; 3], except this segment itself, are suitable.

For the first query, all subsegments of [4; 6], except this segment itself, are suitable.

For the third query, all subsegments of [1; 6] are suitable, except [1; 3], [1; 4], [1; 5], [1; 6], [2; 6], [3; 6], [4; 6].

The second example is shown on the picture below:

<image>
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

@SuppressWarnings("unchecked")
public class E {

    private static Collection<Integer>[] graph;

    private static int[] vis;
    private static Stack<Integer> stack = new Stack<>();

    private static int[] cycle;

    private static void dfs(int v, int parent) {
        stack.push(v);
        vis[v] = 1;

        for (int w : graph[v]) {
            if (w == parent)
                continue;
            if (vis[w] == 0)
                dfs(w, v);
            else if (vis[w] == 1) {
                int max, min = max = v;
                while (!stack.isEmpty()) {
                    int x = stack.pop();
                    max = Math.max(max, x);
                    min = Math.min(min, x);
                    if (x == w)
                        break;
                }
                cycle[min] = max;
            }
        }

        if (!stack.empty() && stack.peek() == v)
            stack.pop();
        vis[v] = 2;
    }

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        String[] splits;

        splits = in.readLine().split(" ");
        int n = Integer.parseInt(splits[0]);
        int m = Integer.parseInt(splits[1]);

        graph = (Collection<Integer>[]) new Collection[n];
        for (int i = 0; i < n; i++)
            graph[i] = new ArrayList<>();

        while (m-- > 0) {
            splits = in.readLine().split(" ");
            int a = Integer.parseInt(splits[0]) - 1;
            int b = Integer.parseInt(splits[1]) - 1;
            graph[a].add(b);
            graph[b].add(a);
        }

        vis = new int[n];
        cycle = new int[n];
        Arrays.fill(cycle, n + 1);

        for (int v = 0; v < n; v++) {
            if (vis[v] == 0)
                dfs(v, -1);
        }

        for (int i = n - 2; i >= 0; i--)
            cycle[i] = Math.min(cycle[i], cycle[i+1]);

        long[] sum = new long[n + 1];
        for (int i = n - 1; i >= 0; i--)
            sum[i] = sum[i+1] + cycle[i] - i;

        int q = Integer.parseInt(in.readLine());
        while (q-- > 0) {
            splits = in.readLine().split(" ");
            int l = Integer.parseInt(splits[0]) - 1;
            int r = Integer.parseInt(splits[1]) - 1;

            int lo = l;
            int hi = r + 1;
            while (lo < hi) {
                int mid = (lo + hi) / 2;
                if (cycle[mid] > r)
                    hi = mid;
                else
                    lo = mid + 1;
            }
            out.println(sum[l] - sum[lo] + 1L * (r - lo + 1) * (r - lo + 2) / 2);
        }
        out.flush();
    }

}
