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

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
    static int gcd(int a, int b) 
    { 
    if (a == 0) 
        return b;  
    return gcd(b % a, a);  
    } 
      
    // method to return LCM of two numbers 
    static int lcm(int a, int b) 
    { 
        return (a*b)/gcd(a, b); 
    } 

	public static void main (String[] args) throws java.lang.Exception
	{
	    Scanner s=new Scanner(System.in);
	    int t=s.nextInt();
        while(t-->0){
            int a=s.nextInt();
            int b=s.nextInt();
            int q=s.nextInt();
            int lc=lcm(a,b);
            while(q-->0){
                long l=s.nextLong();
                long r=s.nextLong();
                if(r<Math.max(a,b)){
                    System.out.print(0+" ");
                }
                else{
                    long count=0;
                if(l<Math.max(a,b)){
                    count=Math.max(a,b)-l;
                }
                while(lc<l-Math.max(a,b)){
                    lc+=lc;
                }
                if(l>=lc&&l<lc+Math.max(a,b)){
                    count+=lc+Math.max(a,b)-l;
                    lc+=lc;
                    //System.out.print(lc+" lcif ");
                }
                    while(lc<=r){
                       count+=Math.min(r-lc+1,Math.max(a,b));
                       lc+=lc;
                    }
                System.out.print(r-l+1-count+" ");
                }
                
            }
            System.out.println(" ");
        }
	}
}
