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 
from fractions import gcd
from math import ceil

T = input()

for _ in xrange(T):
    a, b, q = map(int, raw_input().split())

    gg = gcd(a, b)
    lcm = a*b//gg

    bigger = max(a, b)
    out = []
    for _ in xrange(q):
        l, r = map(int, raw_input().split())

        #count = 0
        #for i in xrange(l, r+1):
        #    if (i%a)%b != (i%b)%a:
        #        count += 1
                #print i, (i%a)%b, (i%b)%a
        #print count

        found = False
        result = 0
        #print lcm
        if l%lcm != 0:
            rem = l % lcm
            result += min(lcm-rem, lcm-bigger)

            l = (l // lcm + 1) * lcm

            #print result, l
            if l > r:
                found = True
                #print a, b, result, l, r, r % lcm, bigger
                if r % lcm <= bigger:
                    result -= lcm - bigger
                else:
                    result -= (lcm - bigger ) - ((r%lcm) - bigger + 1)

        if found:
            #print "here"
            out.append(result)
            continue

        rem = r % lcm
        result += max(rem - bigger + 1, 0)

        r -= r%lcm
        #print result, r
        result += (r-l) // lcm * (lcm-bigger)
        out.append(result)



    print " ".join(map(str, out))