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 
#!/usr/bin/env python3
# Submit as pypy2


from __future__ import print_function, division, unicode_literals

__metaclass__ = type

try:
    input = raw_input
    range = xrange
except NameError:
    pass


import sys


# Test code requires python3
# from hypothesis import given
# from hypothesis import strategies as st
#
#
#def debug(*args, **kwargs):
#    print(*args, *('{}={}'.format(k, v) for k, v in kwargs.items()),
#          sep='; ', file=sys.stderr)


def pshow(a, k=10):
    ans = "[0: " + ', '.join(map(str, a[:k])) + "\n"
    for i in range(1, len(a) // k):
        ans += " {}: ".format(k * i) + ', '.join(map(str, a[k*i:k*(i+1)])) + "\n"
    ans += "]"
    return ans


from fractions import gcd


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


def main():
    #import numpy as np
    T = int(input())
    for _ in range(T):
        A, B, Q = map(int, input().split())
        C = lcm(A, B)
        psum = [0] * (C + 1)
        for x in range(C):
            psum[x + 1] = psum[x] + (x % A % B != x % B % A)
        #debug(C=C)
        #debug(pshow(np.diff(psum)))
        for _ in range(Q):
            L, R = map(int, input().split())
            R += 1
            qL = L // C
            qR = R // C
            #debug(qL=qL, qR=qR)
            if qL == qR:
                print(psum[R % C] - psum[L % C], end=' ')
            else:
                #debug(left=psum[C] - psum[L % C], middle=(qR - qL) * psum[C], right=psum[R % C])
                print(psum[C] - psum[L % C] + (qR - qL - 1) * psum[C] + psum[R % C], end=' ')
        print()


if __name__ == "__main__":
    main()
