Problem: 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 

Solution (in PYTHON):

Solution:
import sys

t = int(sys.stdin.readline())

for _ in xrange(t):
    a, b, q = map(int, sys.stdin.readline().split())

    qq = [None] * q
    for i in xrange(q):
        l, r = map(int, sys.stdin.readline().split())
        qq[i] = (l, r)

    count = 0

    counts = [0] * (a * b)

    for i in xrange(a * b):
        if (i % a) % b != (i % b) % a:
            count += 1
            counts[i] = 1

    for i in xrange(1, len(counts)):
        counts[i] += counts[i -1]

    # for i in xrange(len(counts) - 2, -1, -1):
    #     neg_counts[i] += neg_counts[i + 1]

    for (l, r) in qq:
        l_rem = l % (a * b)
        l_div = l / (a * b)

        if l_rem != 0:
            ll = (l_div + 1) * (a * b)
        else:
            ll = l_div * (a * b)

        r_rem = r % (a * b)
        r_div = r / (a * b)

        if r_rem != 0:
            rr = r_div * (a * b)
        else:
            rr = r_div * a * b

        res = 0
        if rr >= ll:
            res = ((rr - ll) / (a * b)) * count
            # for i in xrange(l, ll):
            if l_rem != 0:
                res += count - counts[l_rem - 1]

            res += counts[r_rem]
            # for i in xrange(ll - l):
            #     x = i + l
            #     if (x % a) % b != (x % b) % a:
            #         res += 1
            #
            # # for i in xrange(rr, r + 1):
            # for i in xrange(r + 1 - rr):
            #     x = i + rr
            #     if (x % a) % b != (x % b) % a:
            #         res += 1

        else:

            res = counts[r % (a*b)] - counts[l % (a * b) - 1]

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