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 com.company;
import java.util.*;
import java.lang.*;
import java.io.*;
//****Use Integer Wrapper Class for Arrays.sort()****
public class CR3 {
    static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));
    public static void main(String[] Args){
        FastReader scan=new FastReader();
        int t=1;
        t=scan.nextInt();
        while(t-->0){
            int a=scan.nextInt();
            int b=scan.nextInt();
            int q=scan.nextInt();
            long v=(a*b)/gcd(a,b);
            while(q-->0){
                long l=scan.nextLong();
                long r=scan.nextLong();
                if(a==b||r<Math.max(a,b)){
                    out.print(0+" ");
                }else{
                    long max=Math.max(a,b);
                    l=Math.max(l,max);
                    long lv=l/v*v;
                    if(l%v!=0){
                        lv+=v;
                    }
                    long ms=0;
                    if(lv<=r){
                        ms++;
                    }
                    ms+=Math.max(0,(r-lv)/v);
                    long ans=0;
                    ans+=Math.max(0,(ms-1)*max);
                    long re=r/v*v;
                    if(re>=l){
                        ans+=Math.min(max,r-re+1);
                    }
                    long ls=l/v*v;
                    if(ls!=l){
                        ls+=max-1;
                        ans+=Math.min(r-l+1,Math.max(0,ls-l+1));
                    }
                    out.print((r-l+1-ans)+" ");
                }
            }
            out.println();
        }
        out.flush();
        out.close();
    }
    public static long gcd(long a,long b){
        if(a==0||b==0){
            return 1;
        }
        if(a%b==0||b%a==0){
            return a%b==0?b:a;
        }
        return a>b?gcd(b,a%b):gcd(a,b%a);
    }
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt()
        {
            return Integer.parseInt(next());
        }

        long nextLong()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }

}