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.*;
 
public class main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while (t-->0) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int q = sc.nextInt();
			
			long rmin = Math.max(a, b);
			long rmax = lcm(a, b) -1;
			
			while(q-->0) {
				long l = sc.nextLong();
				long r = sc.nextLong();
				
				if (a == b) {
					System.out.print(0 + " ");
					continue;
				}

				System.out.print((ans(r, rmax, rmin) - ans(l-1, rmax, rmin)) + " ");
			}
			System.out.println();
		}
	}
	
	public static long ans (long r, long rmax, long rmin) {
		
		long lcmvalue = rmax + 1;
		long s = single(lcmvalue, rmax, rmin);
		long residue = r/lcmvalue;
		long total = s*residue + single(r%lcmvalue, rmax, rmin);
		return total;
	}
	
	public static long single (long r, long rmax, long rmin) {
		long lsub = Math.max(rmin, 1);
		long rsub = Math.min(rmax, r);
		if(rsub < lsub)
			return 0;
		long res = rsub-lsub+1;
		return res;
	}
	
	public static int lcm (int a, int b) {
		return (a*b)/gcd(a,b);
	}
	
	public static int gcd (int a, int b) {
		if (a == 0)
			return b;
		if (b == 0)
			return a;
		if (a > b)
			return gcd (a%b, b);
		else
			return gcd (b%a, a);
	}
}