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:
// package EducationalRound86;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class ProblemC {
    public static void main(String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        StringBuilder print=new StringBuilder();
        int test=Integer.parseInt(br.readLine());
        while(test--!=0){
            st=new StringTokenizer(br.readLine());
            int a=Integer.parseInt(st.nextToken());
            int b=Integer.parseInt(st.nextToken());
            if(a>b){
                int temp=b;
                b=a;
                a=temp;
            }
            int lcm=(a*b)/gcd(a,b);
            int q=Integer.parseInt(st.nextToken());
            while(q--!=0){
                st=new StringTokenizer(br.readLine());
                long l=Long.parseLong(st.nextToken());
                long r=Long.parseLong(st.nextToken());
                if(lcm==b){
                    print.append("0 ");
                }
                else{
                    print.append(getAns(l,r,lcm,b)+" ");
                }
            }
            print.append("\n");
        }
        System.out.print(print.toString());
    }
    public static int gcd(int a,int b){
        if(b==0){
            return a;
        }
        return gcd(b,a%b);
    }
    public static long getAns(long l,long r,int lcm,int b){
        long s=l/lcm;
        long del=0;
        if(l%lcm!=0){
            long start=s*lcm;
//            System.out.println(start);
            for(int i=0;i<b;i++){
                long temp=start+i;
                if(temp>=l&&temp<=r){
                    del++;
                }
            }
            s++;
        }
        long e=r/lcm;
        long total=r-l+1;
//        System.out.println(s+" "+e+" "+del);
        if(s>e){
            return total-del;
        }
        long trust=e-s;
        del+=trust*b;
        long end=e*lcm;
        for(int i=0;i<b;i++){
            if(end+i>r){
                break;
            }
            del++;
        }
//        System.out.println(del);
        return total-del;
    }
}