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.*;
import java.util.*;
public class c86 {

	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);
		int t = scn.nextInt();
		while(t!=0)
		{
			long a = scn.nextLong();
			long b = scn.nextLong();
			int q = scn.nextInt();
			while(q!=0)
			{
				long l = scn.nextLong();
				long r = scn.nextLong();
				long min =  l/(a*b);
				
				
				long max = r/(a*b);
				
				String str="";
				long count=0;
				if(a<=b) 
				{
					   if(r<b)
						{
							str="0";
							System.out.print(str);
							System.out.print(" ");
							
						}
					   else if(a*b<=l)
					   {
						   
						  count= r-l+1 -(b*(max-min-1));
						  long check =b;
						  for(long i =max*(a*b);i<=r;i++)
						  {
							  if(check!=0)
							  {
								  count--;
								  check--;
							  }
							  else
							  {
								  break;
							  }
						  }
						  System.out.print(count);
							System.out.print(" ");
					   }
					   else
					   {
						   for(long i =l;i<=r;i++)
						   {
							   
							   if(i<b)
							   {
								   
								   continue;
							   }
							   else
							   {
								   if(((i%a)%b)!=((i%b)%a))
									{
										count++;
									}
							   }
						   }
						   System.out.print(count);
						   System.out.print(" ");
					   }
						
						
					
					
					
					
					
				}
				else 
				{
					if(r<a)
					{
						str="0";
						System.out.print(str);
						System.out.print(" ");
					}
				   else  if(a*b<=l)
				   {
					  count= r-l+1 -(a*(max-min-1)); 
					  long check =a;
					  for(long i =max*(a*b);i<=r;i++)
					  {
						  if(check!=0)
						  {
							  count--;
							  check--;
						  }
						  else
						  {
							  break;
						  }
					  }
					  System.out.print(count);
						System.out.print(" ");
				   }
					
				   else
				   {
					   for(long i =l;i<=r;i++)
					   {
						   
						   if(i<b)
						   {
							   
							   continue;
						   }
						   else
						   {
							   if(((i%a)%b)!=((i%b)%a))
								{
									count++;
								}
						   }
					   }
					   System.out.print(count);
					   System.out.print(" ");
				   }
				
				
				
				
				}
				
				q--;
			}
			System.out.println();
			t--;
		}

	}

}
