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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        FastReader input=new FastReader();
        PrintWriter out=new PrintWriter(System.out);
        int t=input.nextInt();
        while(t-->0)
        {
            int a,b,q;
            a=input.nextInt();
            b=input.nextInt();
            q=input.nextInt();
            for(int i=0;i<q;i++)
            {
                long l=input.nextLong();
                long r=input.nextLong();
                int lcm=lcm(a,b);
                int max=Math.max(a,b);
                long count=0;
                long x=l/lcm;
                long ll=l/lcm;
                ll=ll*lcm;
                long ul=ll+max-1;
                ll=Math.max(ll,l);
                ul=Math.min(ul,r);
                if(ll<=ul)
                {
                    count+=ul-ll+1;
                }
                long y=r/lcm;
                if(y>x)
                {
                    ll=y;
                    ll=ll*lcm;
                    ul=ll+max-1;
                    ll=Math.max(ll,l);
                    ul=Math.min(ul,r);
                    if(ll<=ul)
                    {
                        count+=ul-ll+1;
                    }
                }
                x++;
                y--;
                if(x<=y)
                {
                    count+=(y-x+1)*max;
                }
                out.print(((r-l+1)-count)+" ");
            }
            out.println();
        }
        out.close();
    }
    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 / gcd(a, b)) * b;
    }
    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;
        }
    }
}