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 io, os
import sys
from atexit import register

input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
sys.stdout = io.BytesIO()
register(lambda: os.write(1, sys.stdout.getvalue()))

tokens = []
tokens_next = 0


def next_str():
    global tokens, tokens_next
    while tokens_next >= len(tokens):
        tokens = input().split()
        tokens_next = 0
    tokens_next += 1
    return tokens[tokens_next - 1]


def nextInt():
    return int(next_str())


def gcd(a, b):
    while b > 0:
        a, b = b, a % b
    return a


def lcm(a, b):
    return (a // gcd(a, b)) * b


def calcIntersection(interval1, interval2):
    if interval1 > interval2:
        interval1, interval2 = interval2, interval1
    if interval1[1] < interval2[0]:
        return 0

    first = max(interval1[0], interval2[0])
    second = min(interval1[1], interval2[1])
    return second - first + 1


def myRangeLen(r):
    return (r.stop - r.start - 1) // r.step + 1


T = nextInt()
for _ in range(T):
    a = nextInt()
    b = nextInt()
    if a > b:
        a, b = b, a

    q = nextInt()
    for i in range(q):
        l = nextInt()
        r = nextInt()

        n = lcm(a, b)
        allRelevantIntervals = range(l - (l % n), r + 1, n)

        res = r - l + 1
        if allRelevantIntervals and allRelevantIntervals[0] < l:
            cur = allRelevantIntervals[0]
            res -= calcIntersection((cur, cur + b - 1), (l, r))
            allRelevantIntervals = allRelevantIntervals[1:]

        if allRelevantIntervals and allRelevantIntervals[-1] + b - 1 > r:
            cur = allRelevantIntervals[-1]
            res -= calcIntersection((cur, cur + b - 1), (l, r))
            allRelevantIntervals = allRelevantIntervals[:-1]

        if allRelevantIntervals:
            res -= myRangeLen(allRelevantIntervals) * b

        sys.stdout.write((str(res) + ' ').encode())
    sys.stdout.write('\n'.encode())
