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 
##a, b = map(int, input().split())
##k = False
##for i in range(10000):
##    if (i % a) % b != (i % b) % a and k == False:
##        print(i, i % a, i % b, (i % a) % b, (i % b) % a)
##        k = True
##    elif (i % a) % b == (i % b) % a and k == True:
##        print(i)
##        k = False
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    if b == 0:
        return a
    return gcd(b, a % b)


def f(a, b, x):
    g = a * b // gcd(a, b)
    #print(g)
    a, b = min(a, b), max(a, b)
    if g == b or x < b:
        return 0
    nn = (x - b) // g + 1
    #print(nn, (nn - 1) * g + b)
    if x - ((nn - 1) * g + b) >= g - b:
        return nn * (g - b)
    else:
        return (nn - 1) * (g - b) + x - ((nn - 1) * g + b) + 1

def ff(a, b, x):
    a, b = min(a, b), max(a, b)
    ans = 0
    for i in range(x + 1):
        if (i % a) % b != (i % b) % a:
            ans += 1
    return ans


##from random import randint
##while True:
##    a = randint(1, 200)
##    b = randint(1, 200)
##    x = randint(1, 100000)
##    #print(f(a, b, x), ff(a, b, x))
##    if f(a, b, x) != ff(a, b, x):
##        print(a, b, x)
gans = []
for _ in range(int(input())):
    a, b, q = map(int, input().split())
    ansi = []
    for i in range(q):
        L, R = map(int, input().split())
        ansi.append(f(a, b, R) - f(a, b, L - 1))
    gans.append(' '.join(map(str, ansi)))
print('\n'.join(gans))
