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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
    public static int gcd(int p, int q){
        if(q == 0) {
            return p;
        }
        while(p%q != 0){
            int r = p % q;
            p = q;
            q = r;
        }
        return q;
    }
    public static void main(String[] args) {
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        int n,i,xMin=Integer.MAX_VALUE,xMax=Integer.MIN_VALUE,yMax=xMax,yMin=xMin,t,j;
        String[] input;
        try{
            t=Integer.parseInt(reader.readLine());
            for (i=0;i<t;i++){
                int a,b,q,minCommonMultiple;
                long l,r,count=0,multipleCount;
                input=reader.readLine().split(" ");
                a=Integer.parseInt(input[0]);
                b=Integer.parseInt(input[1]);
                q=Integer.parseInt(input[2]);
                minCommonMultiple=a*b/gcd(a,b);
                if (a>b){
                    n=a;
                    a=b;
                    b=n;
                }
                for (j=0;j<q;j++){
                    input=reader.readLine().split(" ");
                    l=Long.parseLong(input[0]);
                    r=Long.parseLong(input[1]);
                    multipleCount=r/minCommonMultiple-l/minCommonMultiple;
                    if (l%minCommonMultiple<b){
                        count-=b-l%minCommonMultiple;
                    }
                    if (r%minCommonMultiple<b){
                        count+=b-r%minCommonMultiple-1;
                    }
                    count+=r-l+1-multipleCount*b;
                    System.out.print(count+" ");
                    count=0;
                }
                System.out.println();
            }
        }catch (IOException e) {
            e.printStackTrace();
        }
    }
}