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 
def gcd(a, b):
    """Compute the greatest common divisor of a and b"""
    while b > 0:
        a, b = b, a % b
    return a


def lcmf(a, b):
    """Compute the lowest common multiple of a and b"""
    return a * b // gcd(a, b)


def main():
    cc = int(input())
    for ccc in range(cc):
        a, b, q = [int(v) for v in input().split()]
        data = []
        lcm = lcmf(a, b)
        for i in range(0, lcm):
            if (i % a) % b != (i % b) % a:
                data.append(1)
            else:
                data.append(0)

        res = []
        for cccc in range(q):
            l, r = [int(v) for v in input().split()]
            c = 0
            start = l - l % lcm
            end = r - r % lcm
            if end != r:
                end += lcm
            c = (end - start) // lcm * sum(data[0:lcm])
            c -= sum(data[0:l % lcm])
            c -= sum(data[(r + 1) % lcm: (end + 1) % lcm + lcm])
            res.append(str(c))
        print(" ".join(res))


if __name__ == "__main__":
    # sys.setrecursionlimit(10 ** 6)
    # threading.stack_size(10 ** 8)
    # t = threading.Thread(target=main)
    # t.start()
    # t.join()
    main()
