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 
# Python program to find LCM of two numbers

# Recursive function to return gcd of a and b
def gcd(a, b):
    if a == 0:
        return b
    return gcd(b % a, a)


# Function to return LCM of two numbers
def lcm(a, b):
    return (a * b) / gcd(a, b)

t = int(input())

for test in range(t):
    a, b, q = list(map(int, input().split()))

    if a == b:
        for query in range(q):
            l, r = list(map(int, input().split()))
            print(int(0), end= " ")
        print()

    else:
        greater = max(a, b)
        smaller = min(a, b)
        lc = int(lcm(greater, smaller))
        count = 0
        valid_list = [0] * lc
        valid_count = [0] * lc

        for i in range(0, lc):
            if ((i % smaller) % greater) != ((i % greater) % smaller):
                count += 1
                valid_list[i] = 1
            valid_count[i] = count

        for query in range(q):
            l, r = list(map(int, input().split()))

            total_range = r - l + 1
            num_to_check = total_range % lc
            ans = 0

            #for i in range(l,l+num_to_check):
            #    if valid_list[i % lc] == 1:
            #        ans += 1
            if((l + num_to_check - 1) > r):
                ans += valid_count[r % lc] - valid_count[(l % lc)] + valid_list[(l % lc)]

            elif((l % lc) <= ((l + num_to_check - 1) % lc)):
                ans += valid_count[(l+num_to_check-1) % lc] - valid_count[(l % lc)] + valid_list[(l % lc)]
            else:
                ans += count - valid_count[(l+num_to_check-1) % lc] + valid_list[(l+num_to_check-1) % lc]
                ans += valid_count[l % lc]

            ans += ((total_range - num_to_check) // lc) * count
            print(int(ans),end=" ")
        print()

