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 
def read_int():
    return int(input())


def read_ints():
    return map(int, input().split(' '))


def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)


t = read_int()
for case_num in range(t):
    a, b, q = read_ints()
    g = gcd(a, b)
    lcm = a * b // g
    acc = [0 for i in range(lcm)]
    for i in range(1, lcm):
        acc[i] = acc[i - 1]
        if (i % a) % b != (i % b) % a:
            acc[i] += 1
    ans = []
    for i in range(q):
        l, r = read_ints()
        curr = 0
        n = l // lcm
        x = l % lcm
        m = r // lcm
        y = r % lcm
        if m > n + 1:
            curr += (m - n - 1) * acc[lcm - 1]
        if m > n:
            curr += acc[lcm - 1] - acc[max(0, x - 1)]
            curr += acc[y]
        if m == n:
            curr += acc[y] - acc[max(0, x - 1)]
        ans.append(curr)
    print(' '.join(map(str, ans)))
