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):
    x = [a, b]
    x.sort()
    if b%a==0:
        return a
    else:
        return gcd(b%a, a)

def lcm(a, b):
    return a*b//gcd(a, b)

t = int(input())
for _ in range(t):
    a, b, q = map(int, input().split())
    queries = []
    for i in range(q):
        queries.append(list(map(int, input().split())))
    preset = [0 for i in range(lcm(a, b)+1)]
    for i in range(1, len(preset)):
        preset[i] = preset[i-1]
        if (i%a)%b == (i%b)%a:
            continue
        else:
            preset[i]+=1
    res = []
    for i in queries:
        ans = 0
        ans+= ((i[1]-i[0]+1)//(lcm(a, b)))*preset[-1]
        y = i[0]%(lcm(a, b))
        x = (i[1]-i[0]+1)%(lcm(a, b))
        if y+x-1<(lcm(a,b)):
            ans+=preset[y+x-1]-preset[y-1]
        else:
            ans+=(y+x-1//lcm(a, b))*preset[-1]
            x = (y+x-1)%lcm(a, b)
            ans+=preset[x]-preset[y-1]
        res.append(ans)
        
    print(*res)

