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

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();
    }

}
