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 
#a,b=map(int,input().split())
#k=0
#i=0
#l=1
#r=10000
#while(l<=r):
#    if((l%a)%b != (l%b)%a):
#        k+=1
#    else:
#        print((l%a)%b,l)
#        i+=1
#    l+=1
#print(k,i)
def f(a,b,r):
    d=GCD(a,b)
    m=a*b//d
    p=(r%m)
    if d == min(a,b):
        return 0
    if p>max(a,b)-1:
        p-=max(a,b)-1
    else:
        p=0
    return (r//m)*(m-max(a,b)) + p 

def GCD(a,b):
    while(a!=0 and b!=0):
        if a<b:
            b%=a
        else:
            a%=b
    return a+b

t=int(input())
for  i in range(t):
    a,b,q=map(int,input().split())
    for j in range(q):
        l,r=map(int,input().split())
        if l==1:
            print(f(a,b,r),end=" ")
        else:
            print(f(a,b,r)-f(a,b,l-1),end=" ")
    print()

#print(f(7,10,200))
#print(f(7,10,100))

