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 javax.print.DocFlavor;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class TaskC {
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        PrintWriter pw = new PrintWriter(System.out);
        
        try {
            int t = Integer.parseInt(br.readLine());
            while(t-->0) {
                st = new StringTokenizer(br.readLine());
                int a = Integer.parseInt(st.nextToken());
                int b = Integer.parseInt(st.nextToken());
                int q = Integer.parseInt(st.nextToken());
                long lcm = lcm(a, b);
                while(q-->0) {
                    st = new StringTokenizer(br.readLine());
                    long l = Long.parseLong(st.nextToken());
                    long r = Long.parseLong(st.nextToken());

                    long nums = r-l+1;

                    if(lcm == a || lcm == b) {
                        pw.print(nums + " ");
                    }
                    else {
                        long max = Math.max(a, b);
                        long lbb = l/lcm*lcm;
                        long lbu = lbb+max;
                        long rbb = r/lcm*lcm;
                        long rbu = rbb+max;

                        nums -= (rbb+lcm-lbb)/lcm*max;

                        if(lbu <= l) {
                            nums += max;
                        }
                        else {
                            nums += l-lbb;
                        }

                        if(rbu > r) {
                            nums += rbu-r-1;
                        }

                        pw.print(nums + " ");
                    }
                }
                pw.println();
            }
        }
        finally {
            pw.flush();
            pw.close();
        }
    }

    static long gcd(long a, long b) {
        return b==0?a:gcd(b, a%b);
    }

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