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 
# bhut time lga tha

def gcd(j, k):
    if j == 0:
        return k
    return gcd(k % j, j)


def lcm(j, k):
    return (j*k)//gcd(j, k)


t = int(input())
while t:
    a, b, q = map(int, input().split())
    while q:
        l, r = map(int, input().split())
        if max(a, b) % min(a, b) == 0:
            print(0, end=" ")
            q -= 1
            continue
        lcm_ = lcm(a, b)
        # print(lcm_)
        bol = 0
        if (l / lcm_ >= 1) and (l - (l // lcm_ * lcm_) < max(a, b)):
            bol = 1
        else:
            bol = 0
        p = ((max(a, b) * (l // lcm_)) - (bol * (((l // lcm_) * lcm_) + max(a, b) - l)))
        no_of_equal_mod_above_lcm = (((r // lcm_ - 1)*max(a, b)) + (min((r // lcm_) * lcm_ + max(a, b) - 1, r) - ((r // lcm_) * lcm_)) + 1) - p
        # print(no_of_equal_mod_above_lcm, 'k = ', p)
        if r < max(a, b):
            print(0, end=" ")
        elif r // lcm_ == 0:
            print((r - max(a, b, l) + 1), end=" ")
        else:
            print(r - no_of_equal_mod_above_lcm + (-max(a, b, l) + 1), end=" ")

        q -= 1
    print()
    t -= 1