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.io.*;
import java.util.*;

public class C324C
{

private static StringTokenizer st;
    
    public static void nextLine(BufferedReader br) throws IOException
    {
        st = new StringTokenizer(br.readLine());
    }
    
    public static int nextInt()
    {
        return Integer.parseInt(st.nextToken());
    }
    
    public static String next()
    {
        return st.nextToken();
    }
    
    public static long nextLong()
    {
        return Long.parseLong(st.nextToken());
    }

    public static double nextDouble()
    {
        return Double.parseDouble(st.nextToken());
    }
    
    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        nextLine(br);
        int t=nextInt();
        while(t!=0){
        	nextLine(br);
        	long a=nextLong();
        	long b=nextLong();
        	long q=nextLong();
        	
        if(a>b){
        	a=a^b;
  	b=a^b;
  	a=a^b;
        }
        long lc=a*b;
        long gc=gcd(a,b);
        lc=lc/gc;
        while(q!=0){
        	nextLine(br);
        	long l=nextLong();
        	long r=nextLong();
        	if(lc==b||r<b){
        		System.out.print("0 ");
        		q--;
        		continue;
        	}
        	long not=find(r,lc,b);
        	if(l>1) not-=find(l-1,lc,b);
        	System.out.print(not+" ");
        	q--;
        }
        	System.out.println();
        	t--;
        }
         
    
    }
  	
  static long gcd(long a,long b){
  	if(b==0)
  	return a;
  	
  	return gcd(b,a%b);
  }
  
  static long find(long r,long lc,long b){
  	long blo=r/lc;
  	long last=blo*lc;
  	long not=r;
  	if(blo!=0){
  		not=not-(blo-1)*b;
  		not=not-(long)Math.min(b,r-last+1);
  	}
  	return not-(long)Math.min(r,(b-1));
  }
}