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.io.File;
import java.io.IOException;
import java.util.Scanner;

public final class Main
{
	public static void main(String[] args) throws IOException
	{
		Scanner in = getScan(args);
		int t = in.nextInt();
		in.nextLine();

		while (t-- > 0)
		{
			int a = in.nextInt();
			int b = in.nextInt();
			int q = in.nextInt();
			int m = Math.max(a, b);
			for (int i = 0; i < q; i++)
			{
				long l = in.nextLong();
				long r = in.nextLong();
				long lcm = lcm(a, b);
				long mult = r / lcm - l / lcm;
				l = l % lcm;
				r = r % lcm;
				long res = 0;
				if (l >= m || r >= m)
				{
					res = Math.max(m, r) - Math.max(m, l) + 1;
				}
				res += mult * (lcm - m);
				System.out.print(res + " ");
			}
			System.out.println();
		}

	}

	public static int lcm(int number1, int number2)
	{
		if (number1 == 0 || number2 == 0)
		{
			return 0;
		}
		int absNumber1 = Math.abs(number1);
		int absNumber2 = Math.abs(number2);
		int absHigherNumber = Math.max(absNumber1, absNumber2);
		int absLowerNumber = Math.min(absNumber1, absNumber2);
		int lcm = absHigherNumber;
		while (lcm % absLowerNumber != 0)
		{
			lcm += absHigherNumber;
		}
		return lcm;
	}

	public static int log2nlz(int bits)
	{
		if (bits == 0) return 0; // or throw exception
		return 31 - Integer.numberOfLeadingZeros(bits);
	}

	static Scanner getScan(String[] args) throws IOException
	{
		if (args.length == 0)
		{
			return new Scanner(System.in);
		}
		else
		{
			return new Scanner(new File(args[0]));
		}
	}

}