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.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Map;

public class Main {

    public static void main(String[] args) throws Exception {
        // write your code here
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        for(int k =0;k<n;k++){
            String abq[] = br.readLine().split(" ");
            int a= Integer.parseInt(abq[0]);
            int b = Integer.parseInt(abq[1]);
            int q = Integer.parseInt(abq[2]);
            a = Math.min(a,b);
            b= Math.max(a,b);
            int lcm = lcm(a,b);
            int arr[] = new int[lcm+1];
            int count =0;
            for(int i=b;i<lcm;i++){
                int mod1 = (i%a)%b;
                int mod2= (i%b)%a;
                if(mod1!=mod2){
                    arr[i]=arr[i-1]+1;
                }
                else{
                    arr[i]=arr[i];
                }

            }
            arr[lcm]=arr[lcm-1];

            for(int i =0;i<q;i++){

                String lr[] = br.readLine().split(" ");
                long l = Long.parseLong(lr[0]);
                long r = Long.parseLong(lr[1]);
                if(l!=r){
                    long rlap = r/lcm;
                    int rem = (int)r%lcm;
                    long ans = rlap*arr[lcm]+arr[rem];
                    long effl = l-1;
                    long llap = effl/lcm;
                    int rem2 = (int)effl%lcm;
                    long ans2= llap*arr[lcm]+arr[rem2];
                    if(i==q-1)
                        System.out.print(Math.abs(ans-ans2));
                    else
                        System.out.print(Math.abs(ans-ans2)+" ");
                }

                else{
                    long remm = arr[(int)l%lcm]!=0?1:0;
                    if(i==q-1)
                        System.out.print(remm);
                    else{
                        System.out.print(remm+" ");
                    }

                }



            }
            System.out.println();

        }

    }
    static int lcm (int a,int b){
        int lcm = (a*b);
        int gcd = gcd(b,a);
        return lcm/gcd;
    }

    static int gcd(int b,int a){

        if(a>b){
            return gcd(a,b);
        }
        if(a==0)
            return b;
        return gcd(a,b%a);

    }
}