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.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

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

    static class CYetAnotherCountingProblem {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            for (int test = in.nextInt(); test > 0; --test) {
                int a = in.nextInt(), b = in.nextInt(), q = in.nextInt();
                List<Long> ans = new ArrayList<>();
                while (q-- > 0) {
                    long L = in.nextLong(), R = in.nextLong();
                    if (R <= 200) {
                        ans.add(brute(L, R, a, b));
                    } else {
                        ans.add(brute(L, 200, a, b) + cal(201, R, a, b));
                    }
                }
                for (long x : ans) out.printf("%d ", x);
                out.println();
            }
        }

        private long cal(int L, long R, int a, int b) {
            if (a > b) return cal(L, R, b, a);

            if (b % a == 0) return 0;
            long mul = a * b / gcd(a, b);
            return count(L, R, a) + count(L, R, b) - count(L, R, mul);
        }

        long count(long L, long R, long d) {
            long res = (R / d) - (L / d);
            if (L % d == 0) res++;
            return res;
        }

        int gcd(int a, int b) {
            while (b > 0) {
                int tmp = b;
                b = a % b;
                a = tmp;
            }
            return a;
        }

        long brute(long L, long R, int a, int b) {
            long res = 0;
            for (long x = L; x <= R; ++x) {
                if ((x % a) % b != (x % b) % a) res++;
            }
            return res;
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

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

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

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

    }
}

