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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Nikita Mikhailov
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        COcherednayaZadachaNaPodschet solver = new COcherednayaZadachaNaPodschet();
        int testCount = Integer.parseInt(in.next());
        for (int i = 1; i <= testCount; i++)
            solver.solve(i, in, out);
        out.close();
    }

    static class COcherednayaZadachaNaPodschet {
        public void solve(int testNumber, FastScanner in, PrintWriter out) {

            int a = in.readInt(), b = in.readInt();
            int q = in.readInt();

            for (int i = 0; i < q; i++) {
                long l = in.readLong();
                long r = in.readLong();
                out.println(calc2(a, b, l, r));
            }
        }

        static long calc2(long a, long b, long from, long to) {
            return calc(a, b, to) - calc(a, b, from - 1);
        }

        static long calc(long a, long b, long to) {
            to++;
            long mi = Math.min(a, b);
            long ma = Math.max(a, b);

            long period = getPeriod(a, b) * ma;

            long res = 0;
            long numFullPeriods = to / period;

            res += numFullPeriods * ma;

            long remPeriod = to - numFullPeriods * period;

            if (remPeriod > 0) {
                res += Math.min(remPeriod, ma);
            }

            return to - res;
        }

        static long getPeriod(long a, long b) {
            long max = Math.max(a, b);
            long min = Math.min(a, b);
            Map<Long, Integer> fMax = Factorization.factorize(max);
            Map<Long, Integer> fMin = Factorization.factorize(min);

            for (long base : fMax.keySet()) {
                int val = fMax.get(base);

                if (fMin.containsKey(base)) {
                    fMin.put(base, fMin.get(base) - val);
                }
            }

            long res = 1;

            for (long base : fMin.keySet()) {

                int val = fMin.get(base);
                while (val > 0) {
                    res *= base;
                    val--;
                }
            }

            return res;
        }

    }

    static class Factorization {
        public static Map<Long, Integer> factorize(long n) {
            Map<Long, Integer> factors = new LinkedHashMap<>();
            for (long d = 2; n > 1; ) {
                int power = 0;
                while (n % d == 0) {
                    ++power;
                    n /= d;
                }
                if (power > 0) {
                    factors.put(d, power);
                }
                ++d;
                if (d * d > n) {
                    d = n;
                }
            }
            return factors;
        }

    }

    static class FastScanner {
        private StringTokenizer st;
        private BufferedReader in;

        public FastScanner(final InputStream in) {
            this.in = new BufferedReader(new InputStreamReader(in));
        }

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

        public int readInt() {
            return Integer.parseInt(readToken());
        }

        public long readLong() {
            return Long.parseLong(readToken());
        }

        public String next() {
            return readToken();
        }

    }
}