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.util.*;
import java.lang.*;
import java.io.*;
 
import java.math.BigInteger;
 
public class test
{
	public static long HCF(long a, long b)
	{
		if (a==0)
		return b;
		return HCF(b%a,a);
	}
	public static long LCM(long a, long b)
	{
		long hcf = HCF(a,b);
		return ((a*b)/hcf);
	}
 
	public static long find(long r, long lcm, long a, long b)
	{
		long d = r/lcm - 1;
 
		long var = (r/lcm);
		var = lcm*var;
		long sub3 = Math.min(Math.max(a,b), (r-var+1));
 
		long sub1 = d*Math.max(a,b);
		long sub2 = Math.max(a,b)-1;
 
		// System.out.println(sub1+" "+sub2+" "+sub3+" "+var+" "+lcm);
 
		return (r-sub1-sub2-sub3);
	}
 
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner in=new Scanner(System.in);
		int t=in.nextInt();
		while(--t>=0)
		{
			long a = in.nextLong();
			long b = in.nextLong();
 
			int q = in.nextInt();
 
			long lcm = LCM(a,b);
			StringBuilder str = new StringBuilder();
			while(--q>=0)
			{
				
				long l =in.nextLong();
				long r = in.nextLong();
 
				long cnt1 = find(l-1,lcm, a, b);
				long cnt2 = find(r,lcm, a, b);
 
				// System.out.println(cnt2-cnt1);
				str.append((cnt2-cnt1)+" ");
			}
			System.out.println(str);
 
			
 
			
		}
 
		
	}
}