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

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

t = int(input())
for k in range (t):
    a, b, q = map(int, input().split())
    if b > a:
        temp = b
        b = a
        a = temp
    least_common_multiple = lcm(a, b)
    for i in range (q):
        start, end = map(int, input().split())
        total = end - start + 1
        starting = start//least_common_multiple
        ending = end//least_common_multiple
        answer = 0

        if starting*least_common_multiple + a >= start:
            answer += starting*least_common_multiple + a - start
        if ending*least_common_multiple + a <= end:
            answer += a
        else:
            answer += end - ending*least_common_multiple + 1
        
        answer += (ending-starting-1)*a

        if i != q-1:
            print(max(0, total-answer), end = ' ')
        else:
             print(max(0, total-answer))





