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.math.BigInteger;
import java.util.Scanner;

public class TaskC {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int t = s.nextInt();
		
		while(t-- > 0) {
			int a = s.nextInt();
			int b = s.nextInt();
			long max = Math.max(a, b);
			
			BigInteger ba = new BigInteger(a+"");
			BigInteger bb = new BigInteger(b+"");
			
			BigInteger mul = ba.multiply(bb);
			BigInteger gcd = ba.gcd(bb);
			
			long lcm = mul.divide(gcd).longValue();
			
			int q = s.nextInt();
			while(q-- > 0) {
				
				long l = s.nextLong();
				long r = s.nextLong();
				
				if(lcm == max) {
					System.out.println(0);
					continue;
				}
				
				long start = l - (l%lcm);
				long end = r - (r%lcm);
				
				long count = 0;
				if(start != end) {
					count = ((end-start-lcm)/lcm) * (lcm-max);
				}
				//System.out.println(count);
				long good = lcm-max;
				
				long addstart = Math.min(good, start+lcm-l+1);
				long addend = Math.max(0, r-end-max+1);
				
				count += addend;
				if(start != end) {
					count += addstart;
				}
				
				System.out.print(count + " ");
			}
			System.out.println();
		}
	}
}
