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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CYetAnotherCountingProblem solver = new CYetAnotherCountingProblem();
        solver.solve(1, in, out);
        out.close();
    }

    static class CYetAnotherCountingProblem {
        static int gcd(int a, int b) {
            while (b > 0) {
                int temp = b;
                b = a % b; // % is remainder
                a = temp;
            }
            return a;
        }

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

        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int t = sc.nextInt();
            while (t-- > 0) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                int num = lcm(a, b);
                int[] arr1 = new int[num];
                int[] arr2 = new int[num];
                long[] val = new long[num];
                int q = sc.nextInt();
                while (q-- > 0) {
                    long l = sc.nextLong();
                    long r = sc.nextLong();
                    long x = l;
                    for (int i = 0; i < num; i++) {
                        arr1[i] = (int) ((x % a) % b);
                        arr2[i] = (int) ((x % b) % a);
                        val[i] = x;
                        x++;
                        if (x > r) break;
                    }
                    long ans = 0;
                    // pw.println(Arrays.toString(arr1));
                    //pw.println(Arrays.toString(arr2));
                    for (int i = 0; i < num; i++) {
                        if (arr1[i] != arr2[i]) {
                            long lo = 0;
                            long hi = r;
                            long k = 0;
                            while (lo <= hi) {
                                long mid = (lo + hi) / 2;
                                if (val[i] + 1l * num * mid <= r) {
                                    k = mid + 1;
                                    lo = mid + 1;
                                } else {
                                    hi = mid - 1;
                                }
                            }
                            ans += k;
                        }
                    }
                    pw.print(ans + " ");
                }
                pw.println();
            }
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

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

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

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

    }
}

