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
import os

from collections import Counter, defaultdict, deque


def solve(A, B, Q, LR):
    cumsum = [0]
    for x in range(0, A * B):
        val = 0
        if (x % A) % B != (x % B) % A:
            val = 1
        cumsum.append(cumsum[-1] + val)
    ans = []
    for l, r in LR:
        lq, lr = divmod(l, A * B)
        rq, rr = divmod(r, A * B)
        count = cumsum[-1] * (rq - lq) + cumsum[rr + 1] - cumsum[lr]
        ans.append(count)

    return ' '.join(map(str, ans))


if __name__ == "__main__":
    input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

    T = int(input())
    for t in range(T):
        A, B, Q = [int(x) for x in input().split()]
        LR = [[int(x) for x in input().split()] for i in range(Q)]
        ans = solve(A, B, Q, LR)
        print(ans)
