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 gcd(a, b):
    if (a == 0): return b
    return gcd(b % a, a)

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

t=int(input())
for tt in range(t):
    a, b, q = [int(i) for i in str.split(input(), ' ')]
    # print(a, b)

    ctr = [0]
    lcm_res = lcm(a, b)
    for i in range(1, lcm_res):
        # print(i, (i % a) % b, (i % b) % a, end="\t")
        if (i % a) % b != (i % b) % a:
            ctr.append(ctr[-1]+1)
        else:
            ctr.append(ctr[-1])
    # print()
    # print(ctr)
    res = []
    for qq in range(q):
        l, r = [int(i) for i in str.split(input(), ' ')]
        cur_res = 0
        prev_l = l // lcm_res * lcm_res
        next_l = (1 + l // lcm_res) * lcm_res
        prev_r = r // lcm_res * lcm_res
        # print(prev_l, prev_r)

        if prev_l == prev_r:
            # print('a')
            if l - prev_l - 1 < 0:
                cur_res += ctr[r - prev_r]
            else:
                cur_res += ctr[r - prev_r] - ctr[l - prev_l - 1]
        else:
            # print('b',(ctr[-1] - ctr[l - prev_l - 1]), ctr[r - prev_r])
            if l - prev_l - 1 < 0:
                cur_res += ctr[-1] + ctr[r - prev_r]
            else:
                cur_res += (ctr[-1] - ctr[l - prev_l - 1]) + ctr[r - prev_r]

        if next_l < prev_r:
            # print('c', next_l, prev_r)
            cur_res += (prev_r - next_l) // lcm_res * ctr[-1]
        res.append(int(cur_res))
    print(' '.join(map(str, res)))
    # print()
