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.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

public class C {
	
	static int N;
	static List<Integer>[] adj;
	static int[] parent;
	static boolean[] black;
	static int[] to;
	
	static void calcCycles() {
		to = new int[N];
		Arrays.fill(to, -1);
		black = new boolean[N];
		parent = new int[N];
		Arrays.fill(parent, -2);
		for (int i = 0; i < N; i++) if (parent[i] == -2) {
			parent[i] = -1;
			visit(i);
		}
	}
	
	static void visit(int node) {
		for (int vec : adj[node]) if (vec != parent[node] && (parent[node] != -1 || parent[vec] == -2)) {
			if (parent[vec] == -2) {
				parent[vec] = node;
				visit(vec);
			} else if (!black[vec]) {
				int mini = Math.min(vec, node), maxi = Math.max(vec, node);
				int tmp = node;
				while (parent[tmp] != vec) {
					tmp = parent[tmp];
					mini = Math.min(mini, tmp);
					maxi = Math.max(maxi, tmp);
				}
				to[mini] = maxi;
			}
		}
		black[node] = true;
	}
	
	public static void main(String[] args) throws IOException {
		MyScanner sc = new MyScanner();
		BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
		N = sc.nextInt();
		int M = sc.nextInt();
		adj = new List[N];
		for (int i = 0; i < adj.length; i++) {
			adj[i] = new ArrayList<>();
		}
		int a, b;
		for (int i = 0; i < M; i++) {
			a = sc.nextInt() - 1;
			b = sc.nextInt() - 1;
			adj[a].add(b);
			adj[b].add(a);
		}
		calcCycles();
		int[] right = new int[N];
		right[N-1] = 1;
		for (int i = right.length - 2; i >= 0; i--) {
			right[i] = 1 + right[i+1];
			if (to[i] != -1) right[i] = Math.min(right[i], to[i] - i);
		}
		long[] acum = new long[N];
		acum[0] = right[0];
		for (int i = 1; i < N; i++) {
			acum[i] = acum[i-1] + right[i];
		}
		int q = sc.nextInt();
		int l, r, ll, rr, med;
		for (int i = 0; i < q; i++) {
			l = sc.nextInt() - 1;
			r = sc.nextInt();
			ll = l - 1;
			rr = r;
			while (ll + 1 < rr) {
				med = (ll + rr) / 2;
				if (med + right[med] >= r) rr = med;
				else ll = med;
			}
			long ans = (r - rr) * (long)(r - rr + 1) / 2;
			ans += (rr > 0 ? acum[rr-1] : 0) - (l > 0 ? acum[l-1] : 0);
			out.append(ans+"\n");
		}
		out.flush();
	}
	
	static class MyScanner {
		private BufferedReader br;
		private StringTokenizer tokenizer;
		
		public MyScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		
		public int nextInt() {
//			return elems[idx++];
			return Integer.parseInt(next());
		}
		
		public long nextLong() {
			return Long.parseLong(next());
		}
	}
}
