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
    else:
        return gcd(b%a,a)

def go (a,b,n) :
    lcmm=(a*b)//gcd(a,b)
    ans=((n)//lcmm)*max(a,b)
    p=((n)//lcmm)*lcmm
    
    ans+=min(n-p+1,max(a,b))
    return ans

t=int(input())
while t>0 :
    t-=1
    s=input().split()
    a=int(s[0])
    b=int(s[1])
    q=int(s[2])
    
    list1= [] 
    for i in range (0,q):
        p=input().split()
        l=int(p[0])
        r=int(p[1])
        list1.append((r-l+1)-(go(a,b,r)-go(a,b,l-1)))
        list1[i]=int(list1[i])
    
    for i in range (0,len(list1)) :
        print(int(list1[i]),end=" ")
    print("",end="\n")