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.*;
import java.util.StringTokenizer;

public class CaseC {

    public static void main(String[] args) throws Exception {
        int tc = scan.nextInt();
        for (int i = 0; i < tc; i++) {
            solve();
        }
        out.close();
    }

    private static void solve() {
        int a = scan.nextInt();
        int b = scan.nextInt();
        int q = scan.nextInt();
        int gcd = gcd(a, b);
        int multiplier = a * b / gcd;
        int fullTotal = 0;
        int[] prefixSum = new int[multiplier];
        for (int i = 0; i < multiplier; i++) {
            if (i > 0) {
                prefixSum[i] = prefixSum[i - 1];
            }
            if (((i) % a) % b != ((i) % b) % a) {
                fullTotal++;
                prefixSum[i]++;
            }
        }
        for (int qq = 0; qq < q; qq++) {
            long l = scan.nextLong();
            long r = scan.nextLong();
            if (r - l < multiplier) {
                long output = 0;
                long startHigh = (long) Math.ceil((l + 1) / (double) multiplier);
                startHigh *= multiplier;
                long endLow = (long) Math.floor((r + 1) / (double) multiplier);
                endLow *= multiplier;
                for (long i = l; i <= r; i++) {
                    if (((i) % a) % b != ((i) % b) % a) {
                        output++;
                    }
                }
//                if (startHigh > endLow) {
//                    output = getSum(prefixSum, (int) (l % multiplier), (int) (r % multiplier));
//                } else {
//                    output += getSum(prefixSum, (int) (l % multiplier), (int) ((startHigh - 1) % multiplier));
//                    output += getSum(prefixSum, (int) (endLow % multiplier), (int) (r % multiplier));
//                }
                out.println(output);
            } else {
                long output = 0;
                long startHigh = (long) Math.ceil((l + 1) / (double) multiplier);
                startHigh *= multiplier;
                long endLow = (long) Math.floor((r) / (double) multiplier);
                endLow *= multiplier;
                output += getSum(prefixSum, (int) (l % multiplier), (int) ((startHigh - 1) % multiplier));
                output += getSum(prefixSum, (int) (endLow % multiplier), (int) (r % multiplier));
                output += ((endLow - startHigh) / multiplier) * fullTotal;
                out.println(output);
            }
        }
    }

    static int getSum(int[] prefixSum, int l, int r) {
        int left = (l > 0) ? prefixSum[l - 1] : 0;
        return prefixSum[r] - left;
    }

    static int gcd(int a, int b) {
        if (a > b) {
            return gcd(b, a);
        }
        if (a == 0) return b;
        return gcd(b % a, a);
    }

    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

    public static MyScanner scan = new MyScanner();

    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            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;
        }

    }
    //--------------------------------------------------------

}