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 
def gcd(a,b): 
    if a == 0: 
        return b 
    return gcd(b % a, a) 
def lcm(a,b): 
    return (a*b) // gcd(a,b) 

def getAns(equalcount,r,lcmm):
    basecount=r//lcmm
    baseans=basecount*equalcount
    rem=r%lcmm
    if rem>=(equalcount-1):
        baseans+=(equalcount-1)
    else:
        baseans+=rem
    return baseans

t=int(input())
for hh in range(0,t):
    a,b,q=[int(x) for x in input().split()]
    a1=[]
    b1=[]
    for i in range(0,201):
        a1.append(i)
        b1.append(i)
    mx=max(a,b)
    equalcount=0
    for i in range(1,mx+1):
        a1[i]=(a1[i]%a)%b
        b1[i]=(b1[i]%b)%a
        if(a1[i]==b1[i]):
            equalcount+=1
    lcmm=lcm(a,b)
    equalcount+=1
    # lcmm=lcm(a,b)
    # print(equalcount,lcmm)
    for i in range(0,q):
        l,r=[int(x) for x in input().split()]
        if(a==b or a%b==0 or b%a==0):
            ans=0
        else:
            second=getAns(equalcount,l-1,lcmm)
            first=getAns(equalcount,r,lcmm)
            ans=(r-first)-(l-1-second)
            # print(second,first)
        print(ans,end=" ")
    print()
