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.io.*;
public class main
{
 static Hashtable<Integer ,Integer>hash=new Hashtable<>();
 static int dp[][];
 static int ans[]=new int[2001];
	public static void main(String args[]) throws java.lang.Exception
	{
	  
 	BufferedReader inp = new BufferedReader (new InputStreamReader(System.in));
int t=Integer.parseInt(inp.readLine());
while(t-->0)
{
  String h[]=inp.readLine().split(" ");
  int a=Integer.parseInt(h[0]);
  int b=Integer.parseInt(h[1]);
  int q=Integer.parseInt(h[2]);
  int lc=lcm(a,b);
  StringBuilder sb=new StringBuilder();
  for(int i=0;i<q;i++)
  {
  	  

  	String hh[]=inp.readLine().split(" ");
  	long l=Long.parseLong(hh[0]);
  	long r=Long.parseLong(hh[1]);
  	if(r<Math.max(a,b) || (a==1 || b==1) ||(a==b) ||(Math.max(b,a)%Math.min(a,b)==0)){sb.append(0+" ");}
  	else{

l=Math.max(Math.max((l/lc)*lc+Math.max(a,b),Math.max(a,b)),l);
long g=((r/lc)*lc)+Math.max(a,b)-1;
long u=0;
if(g>r){u+=g-r;}
// System.out.println((-(r)/lc+l/lc)*Math.max(a,b)+" "+u+" "+(r-l+1));
long kk=l<=r?r-l+1+(-(r)/lc+l/lc)*Math.max(a,b)+u:0;;
  	sb.append(kk+" ");
  long c=0;
//   	for(long j=l;j<=r;j++){if(((j%a)%b)!=((j%b)%a)){System.out.print(j+" ");c+=1;}}
// System.out.println((kk==c)+" "+kk+" "+c);
  }
  	
  }
  System.out.println(sb);
  // System.out.println(sb);
}
	   
	   
	}
	static int lcm(int a, int b)
	{
		return a*b/gcd(Math.min(a,b),Math.max(b,a));
	}
	static int gcd(int a, int b)
	{
		if(a==0){return b;}
		return gcd(b%a,a);
	}

}

  class Pair
  {
     String a;
     int b;
     Pair(String c , int d){a=c;b=d;}
  }