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 math

# def the_number_of_matching_numbers(border):
#     ...


def lcm(a, b):
    least_common_multiple = max(a, b)
    while least_common_multiple % a != 0 or least_common_multiple % b != 0:
        least_common_multiple += 1

    return least_common_multiple


for _ in range(int(input())):
    a, b, q = map(int, input().split())
    lcm_of_a_and_b = lcm(a, b)
    x = 0
    for ___ in range(q):
        l, r = map(int, input().split())
        if (l - 1) // lcm_of_a_and_b * lcm_of_a_and_b == 0:
            if l - 1 >= max(a, b):
                subtractible = l - max(a, b)
            else:
                subtractible = 0
        elif (l - 1) // lcm_of_a_and_b * lcm_of_a_and_b == l - 1:
            subtractible = (l - 1) // lcm_of_a_and_b * (lcm_of_a_and_b - max(a, b))
        elif (l - 1) // lcm_of_a_and_b * lcm_of_a_and_b < l - 1:
            subtractible = (l - 1) // lcm_of_a_and_b * (lcm_of_a_and_b - max(a, b))
            if l - 1 >= max(a, b) + (l - 1) // lcm_of_a_and_b * lcm_of_a_and_b:
                subtractible += l - (max(a, b) + (l - 1) // lcm_of_a_and_b * lcm_of_a_and_b)

        if r // lcm_of_a_and_b * lcm_of_a_and_b == 0:
            if r >= max(a, b):
                minuend = r - max(a, b) + 1
            else:
                minuend = 0
        elif r // lcm_of_a_and_b * lcm_of_a_and_b == r:
            minuend = r // lcm_of_a_and_b * (lcm_of_a_and_b - max(a, b))
        elif r // lcm_of_a_and_b * lcm_of_a_and_b < r:
            minuend = r // lcm_of_a_and_b * (lcm_of_a_and_b - max(a, b))
            if r >= max(a, b) + r // lcm_of_a_and_b * lcm_of_a_and_b:
                minuend += r + 1 - (max(a, b) + r // lcm_of_a_and_b * lcm_of_a_and_b)

        # print(minuend, subtractible)
        print(minuend - subtractible, end=' ')
    print()
