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):
    while b > 0:
        (a, b) = (b, a % b)
    return a

# print(gcd(17, 27))


def play(a, b, l, r):

    print(f"a = {a}, b = {b}")

    for i in range(l, r+1):

        j = (i % a) % b
        k = (i % b) % a
        print(f"{i}: {j} {k} {'YES' if j == k else ''}")

    print()

# play(4, 6, 1, 20)
# play(4, 5, 1, 40)
# play(7, 10, 100, 200)

def solve(a, b, q, l, r):

    def val(n):
        return (cyc - a) * ((n + 1)// cyc) + max(((n + 1) % cyc) - a, 0)

    a, b = max(a, b), min(a, b)    
    cyc = a * b // gcd(a, b)

    # for i in range(q):
    #     print(f"{i}: {l[i]} {r[i]} {val(l[i])} {val(r[i])}")
        
    return [ val(r[i]) - val(l[i]-1) for i in range(q) ]
        


t = int(input().strip())

for _ in range(t):

    a, b, q = list(map(int, input().strip().split()))

    l = []
    r = []
    for _ in range(q):
        x = list(map(int, input().strip().split()))
        l.append(x[0])
        r.append(x[1])

    print(' '.join(map(str, solve(a, b, q, l, r))))
