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 
import sys
input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return s
def invr():
    return(map(int,input().split()))



def from_file(f):
    return f.readline


def solve(l, r, a, b, lcm, c_lcm, dp: list):
    l_count = l // lcm
    r_count = r // lcm

    tmp = (r_count-l_count) * c_lcm

    # [l_count ... l) check and deduce
    left = dp[l % lcm-1] if l%lcm > 0 else 0
    right = dp[r % lcm]

    result = tmp - left + right
    return (r-l+1) - result



def get_lcm(a, b):
    def get_gcd(x, y):
        if y > x:
            x, y = y, x
        r = x % y
        if r == 0:
            return y
        return get_gcd(r, y)

    return (a * b) // get_gcd(a, b)

def count_interval(l, r, a, b, dp):
    count = 0
    while l <= r:
        if l % a % b == l % b % a:
            count += 1
        dp[l] = count
        l += 1

    return count

# with open('3.txt') as f:
#     input = from_file(f)
t = inp()
for _ in range(t):
    a, b, q = invr()
    result = []
    lcm = get_lcm(a, b)
    dp = [0] * lcm
    c_lcm = count_interval(0, lcm-1, a, b, dp)
    for _ in range(q):
        l, r = invr()

        res = solve(l, r, a, b, lcm, c_lcm, dp)
        result.append(str(res))
    print(" ".join(result))


