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.util.Scanner;

public class C1342 {
	private static int length;
	private static long[] p = new long [41000];
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int cases = scanner.nextInt();
		for(int i = 0; i < cases; i++) {
			int a = scanner.nextInt();
			int b = scanner.nextInt();
			int q = scanner.nextInt();
			construct(a, b);
			for(int j = 0; j < q; j++) {
				long l = scanner.nextLong();
				long r = scanner.nextLong();
				System.out.print(query(l, r) + " ");
			}
			System.out.println();
		}
	}
	
	static void construct(int a, int b) {
		length = a * b;
		p[0] = 0;
		for(int i = 1; i <= length; i++) {
			p[i] = p[i - 1];
			if((i % a) % b != (i % b) % a)
				p[i]++;
		}
	}
	
	private static long query(long temp) {
		long count = temp / length;
		long remainder = temp % length;
		return 1l * p[length] * count + p[(int) remainder]; 
	}
	
	static long query(long temp1, long temp2) {
		return query(temp2) - query(temp1 - 1);
	}	
}
