You are given two integers a and b, and q queries. The i-th query consists of two numbers l_i and r_i, and the answer to it is the number of integers x such that l_i ≤ x ≤ r_i, and ((x mod a) mod b) ≠ ((x mod b) mod a). Calculate the answer for each query.

Recall that y mod z is the remainder of the division of y by z. For example, 5 mod 3 = 2, 7 mod 8 = 7, 9 mod 4 = 1, 9 mod 9 = 0.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then the test cases follow.

The first line of each test case contains three integers a, b and q (1 ≤ a, b ≤ 200; 1 ≤ q ≤ 500).

Then q lines follow, each containing two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ 10^{18}) for the corresponding query.

Output

For each test case, print q integers — the answers to the queries of this test case in the order they appear.

Example

Input


2
4 6 5
1 1
1 3
1 5
1 7
1 9
7 10 2
7 8
100 200


Output


0 0 0 2 4 
0 91 
import java.io.*;
import java.util.*;

public class Main {
	static Scanner sc = new Scanner(System.in);
	static PrintWriter out = new PrintWriter(System.out);
	static int arr[], a, b;

	static int[] preprocess(int a, int b) {
		int arr[] = new int[a * b + 5];
		for (int i = 1; i <= a * b; i++) {
			arr[i] = arr[i - 1];
			arr[i] += ((i % a) % b != (i % b) % a) ? 1 : 0;
		}
		return arr;
	}

	static long query(long r) {
		int len = a * b;
		long ret = r / len;
		ret *= arr[len];
		return ret + arr[(int) (r % len + len) % len];
	}

	static void solve() throws Exception {
		a = sc.nextInt();
		b = sc.nextInt();
		arr = preprocess(a, b);
		int q = sc.nextInt();
		while (q-- > 0) {
			long l = sc.nextLong(), r = sc.nextLong();
			out.print((query(r) - query(l - 1)) + " ");
		}
	}

	public static void main(String[] args) throws Exception {
		int t = sc.nextInt();
		while (t-- > 0) {
			solve();
			out.println();
		}
		out.close();
	}
}

class Scanner {
	StringTokenizer st;
	BufferedReader br;

	public Scanner(InputStream system) {
		br = new BufferedReader(new InputStreamReader(system));
	}

	public Scanner(String file) throws Exception {
		br = new BufferedReader(new FileReader(file));
	}

	public String next() throws IOException {
		while (st == null || !st.hasMoreTokens())
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}

	public String nextLine() throws IOException {
		return br.readLine();
	}

	public int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	public double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	public Long nextLong() throws IOException {
		return Long.parseLong(next());
	}
}