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

# Function to return LCM of two numbers
def lcm(a,b):
    return (a*b) / gcd(a,b)


for p in range(0,t):
    ans = []
    a,b,q = map(int,input().split())
    chota = min(a,b)
    bada = max(a,b)
    for i in range(0,q):
        l,r = map(int,input().split())
        # print(l,r)
        if(r<=chota):
            ans.append(0)
        else:
            lc = int(lcm(chota,bada))
            # print(lc)
            # print(chota,bada)
            x = l//lc
            # print(x,'  = x')

            y = r//lc
            # print(y,' = y')
            if(y == 0):
                if(r < bada):
                    ans.append(0)
                else:
                    if(l > bada):
                        ans.append(r-l+1)
                    else:
                        ans.append(r - bada + 1)
                # print('here')
            else:
                if((x*lc)+bada <= l and (y*lc)+bada <= r):
                    # print('here',l)
                    temp = y-x
                    ans.append((r-l+1) - (temp*bada))
                    # print((r-l+1) - (temp*bada))

                else:
                    temp = (y-x)*bada
                    extra = 0
                    # print(temp)
                    # print(temp)
                    if((x*lc)+bada > l):
                        extra += ((x*lc)+bada) - l
                    # print(extra,'lol')
                    if((y*lc)+bada > r):
                        extra -= ((y*lc)+bada) - r - 1
                    # print(extra,'lol')
                    ans.append((r-l+1) - (temp+extra))
                    # print((r-l+1) - (temp+extra),end='***')
                    # print()
    print(*ans)


