Problem: 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 

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class C {

	static long m = (long) (1e9 + 7);

	public static void main(String[] args) throws IOException {
		Scanner scn = new Scanner(System.in);
		StringBuilder tal = new StringBuilder();
		for (int i = 1; i <= 200; i++)
			for (int j = 1; j <= 200; j++) {
				int gc = fd(i, j);
				talib[i][j] = g(i, j);
			}
		int T = scn.nextInt(), tcs = 0;
		C: while (tcs++ < T) {
			int a = scn.nextInt(), b = scn.nextInt(), q = scn.nextInt();
			while (q-- > 0) {
				long l = scn.nextLong(), r = scn.nextLong();
				int fgh = talib[a][b];
				long ga = fn(fgh, r, a, b), anl = fn(fgh, l - 1, a, b);
				tal.append((ga - anl) + " ");
			}
			tal.append("\n");
		}
		System.out.print(tal);
	}

	static int fd(int a, int b) {
		return (a == 0) ? b : fd(b % a, a);
	}

	static int g(int a, int b) {
		return (a * b) / fd(a, b);
	}

	static int talib[][] = new int[201][201];

	static long fn(int ll, long r, int a, int b) {
		if (r == 0)
			return 0;
		int max = Math.max(a, b);
		long ct = (r / ll) * (ll - max), rem = r % ll;
		if (rem >= max)
			ct = ct + (rem - max) + 1;
		return ct;
	}

	static class Scanner {

		StringTokenizer st;
		BufferedReader br;

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

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

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

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