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 
/**
 * @author egaeus
 * @mail sebegaeusprogram@gmail.com
 * @veredict Accepted
 * @url <https://codeforces.com/problemset/problem/1342/C>
 * @category math
 * @date 27/04/2012
 **/

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

import static java.lang.Integer.parseInt;

public class CF1342C {
    public static void main(String args[]) throws Throwable {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int T = parseInt(in.readLine());
        StringBuilder sb = new StringBuilder();
        for (int t = 0; t++ < T;) {
            StringTokenizer st = new StringTokenizer(in.readLine());
            long A = parseInt(st.nextToken()), B = parseInt(st.nextToken()), Q = parseInt(st.nextToken()), MOD = A*B;
            long s = 0;
            long[] values = new long[(int)MOD];
            for(long i = 0; i < MOD; i++) {
                if ((i % A) % B != (i % B) % A) {
                    s++;
                }
                values[(int)i]=s;
            }

            for(int q = 0; q < Q; q++) {
                st = new StringTokenizer(in.readLine());
                long L = Long.parseLong(st.nextToken()), R = Long.parseLong(st.nextToken());
                if(q>0)sb.append(" ");
                sb.append(f(s, MOD, R, A, B, values)-f(s, MOD, L-1, A, B, values));
            }
            sb.append("\n");
        }
        System.out.print(new String(sb));
    }

    static long f(long s, long MOD, long I, long A, long B, long[] values) {
        long result = (I / MOD) * s;
        return result + values[(int)(I%MOD)];
    }
}
