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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class C {

	public static void main(String[] args) throws IOException {
		BufferedReader file = new BufferedReader(new InputStreamReader(System.in));
		int inputs = Integer.parseInt(file.readLine());
		while(inputs-->0) {
			StringTokenizer st = new StringTokenizer(file.readLine());
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken());
			int q = Integer.parseInt(st.nextToken());
//			System.out.println(LCM(a, b));
			int[] preSum = new int[LCM(a, b)+1];
			for(int i = 1; i < preSum.length; i++) {
				preSum[i] = preSum[i-1];
				if(i%a%b != i%b%a)
					preSum[i]++;
			}
//			System.out.println(Arrays.toString(preSum));
			StringBuilder ans = new StringBuilder();
			while(q-->0) {
				st = new StringTokenizer(file.readLine());
				long l = Long.parseLong(st.nextToken());
				long r = Long.parseLong(st.nextToken());
				ans.append(getAns(r, preSum)-getAns(l-1, preSum) + " ");
			}
			System.out.println(ans.toString().trim());
		}

	}

	public static int GCD(int a, int b) {
		if(b == 0)
			return a;
		return GCD(b, a%b);
	}
	
	public static int LCM(int a, int b) {
		return a * b / GCD(a, b);
	}
	
	public static long getAns(long n, int[] preSum) {
		return n/(preSum.length-1)*preSum[preSum.length-1]+preSum[(int) (n%(preSum.length-1))];
	}
}