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
import math
import bisect

def query_sum_value(A, p):
    n = len(A)
    ans = (p + 1) // n * A[-1]
    if (p + 1) % n:
        ans += A[(p + 1) % n - 1]
    return ans

def solve(a, b, q):
    A = [0] * (a * b)
    for i in range(len(A)):
        if i % a % b != i % b % a:
            A[i] = 1
    for i in range(1, len(A)):
        A[i] += A[i-1]
    #print('A: %s' % (str(A)))
    ans = []
    for _ in range(q):
        l, r = map(int, input().split())
        val = query_sum_value(A, r) - query_sum_value(A, l - 1)
        ans.append(val)
    return ans

def main():
    for _ in range(int(input())):
        a, b, q = map(int, input().split())
        ans = solve(a, b, q)
        print(' '.join(list(str(a) for a in ans)))

if __name__ == "__main__":
    main()
