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 a > 0 and b > 0:
        a, b = b % a, a
    return a + b

t = int(input())
while t > 0:
    a, b, q = map(int, input().split())
    ans = ''
    nk = a * b // gcd(a, b)
    while q > 0:
        l, r = map(int, input().split())
        if(a % b == 0 or b % a == 0):
            ans += '0 '
        l1 = (l + nk - 1) // nk * nk
        r1 = max((r - max(a, b)) - 1, 0) // nk * nk
        k =  ((r1 - l1) // nk + 1) * max(a, b)
        l2 = (l - 1) // nk * nk
        if l2 + max(a, b) - 1>= l:
            k += min(l2 + max(a, b) - 1, r) - l + 1
        r2 = r // nk * nk
        if r2 + max(a, b) >= r and r2 != l1 and r2 != r1:
            k += r - max(r2, l) + 1
        ans += str(r - l + 1 - k) + ' '
        q -= 1
    print(ans)
    t -= 1
'''
4 6
1 5
'''
