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 b!= 0:
        r = a%b
        a = b
        b = r

    return a


def solve(a,b,l,r):
    lcm = a*b/gcd(a,b)
    right = lcm
    left = l
    track = 0
    n = 2

    if r < b:
        return 0


    cnt = 0

    while right < left:
        right += lcm

    while True:
        if r < right:
            right = r
            left = b
            cnt = right-left+1
            return (int(cnt))

        else:
            if n % 2 == 0: #even case
                cnt += right - left -1
                left = right
                right = right + b
                n += 1

            else: #odd case

                left = right
                if right+lcm > r:
                    cnt += r - left + 2
                    break
                right += lcm
                n += 1



    return(int(cnt))




if __name__ == '__main__':
    t = int(input())
    for _ in range(t):
        a,b,q = map(int, input().split())
        ar = []
        for _ in range(q):
            l,r = map(int, input().split())
            ar.append(solve(a,b,l,r))

        print(" ".join(map(str, ar)))