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 
''' GCD (Greatest Common Divisor) '''
def gcd(a, b):
    mod = a % b
    while mod > 0:
        a = b
        b = mod
        mod = a % b
    return b

''' LCM (Least Common Multiple) '''
def lcm(a, b):
    return a * b // gcd(a, b)

''' Number of intersection points of two lines in 1 dimension '''
def num_of_intersect_two_lines(line_1, line_2):
    return max(min(line_1[1], line_2[1]) - max(line_1[0], line_2[0]) + 1, 0)

for _ in range(int(input())):
    a, b, q = map(int, input().split())
    for i in range(q):
        l, r = map(int, input().split())
        total_line = [max(l, b), r]

        lcm_value = lcm(a, b)
        left_lcm = (max(l, b) // lcm_value)
        left_line = [left_lcm * lcm_value, left_lcm * lcm_value + b - 1]
        right_lcm = (r // lcm_value)
        right_line = [right_lcm * lcm_value, right_lcm * lcm_value + b - 1]

        subtraction = num_of_intersect_two_lines(total_line, right_line)
        if right_lcm - left_lcm >= 1:
            subtraction += num_of_intersect_two_lines(total_line, left_line)
            subtraction += (right_lcm - left_lcm - 1) * b
        
        print(max(r - max(l, b) + 1 - subtraction, 0))