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 modmod(x, a, b):
    r1 = (x % a) % b
    r2 = (x % b) % a
    return 0 if r1 == r2 else 1

t = int(input())
for case in range(t):
    a, b, q = map(int, input().split())

    prod = a*b
    status = prod*[0]
    cum_left = [0]
    total = 0
    for i in range(prod):
        status[i] = modmod(i, a, b)
        total += status[i]
        cum_left.append(total)

    cum_left.pop()

    sum_prod = int(total)

    cum_right = []

    for i in range(prod):
        total -= status[i]
        cum_right.append(total)

    answers = []

    for query in range(q):
        l, r = map(int, input().split())
        if prod == 1:
            answers.append(0)            
        else:
            lower = l // prod
            upper = (r-1) // prod + 1
            if r % prod == 0:
                upper += 1
            diff = upper - lower
            result = diff*sum_prod - cum_left[(l) % prod] - cum_right[(r) % prod]
            answers.append(result)
    print (*answers)

    
    

    
        
        
    
