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 
import sys
from collections import defaultdict as dd
input=sys.stdin.readline
mod=1000000007
def power(x,y): 
    res = 1
    while (y > 0):  
        if ((y & 1) == 1) : 
            res = (res * x )%m
        y = y >> 1
        x =( x * x )%m
      
    return res%m
def gcd(a,b): 
    if a == 0: 
        return b 
    return gcd(b % a, a) 

def lcm(a,b): 
    return (a*b)//gcd(a,b)
for _ in range(int(input())):
##    t=input()
##    l=[int(t[i]) for i in range(len(t)-1)]
##    m="".join([str(i) for i in l])
##    c1=l.count(1)
##    n=len(l)
##    c0=n-c1
##    if(c1==0 or c0==0):
##        print(m)
##    else:
##        if(l[0]==0):
##            s="0"
##            f=0
##        else:
##            s="1"
##            f=1
##        
##        h=2*n
##        for i  in range(1,h-1):
##            if(f==0):
##                s+=("1")
##                f^=1
##            else:
##                s+=("0")
##                f^=1
##        print(s)
##    
    a,b,q=map(int,input().split())
    li=[]
    lc=lcm(a,b)
    mx=max(a,b)
    ran=lc-mx+1
    f=0
    if(mx%min(a,b)==0):
        f=1
    for i in range(q):
        c=0
        l,r=map(int,input().split())
        if(f==1):
            li=[0]*q
            print(*li)
        elif(r<mx):
            li.append(0)
        else:
            
            mulp=0
            ul=int(r//lc)*lc
            fm=(int(l//lc))*lc
            le=max(fm+mx-l,0)
            
            
##            if(l%lc==0):
##                le=0
            
            if(ul+mx>r):
                le+=r-ul+1
            else:
                le+=mx
##            print(le)    
##            if(r%lc==0):
##                mulp+=1
            
            mulp=int(r//lc)-int(l//lc)-1
            le+=mulp*mx
            li.append(r-l+1-le)
    if(f==0):
         print(*li)
##            print(r-l+1-le)
            
##            le=r-ul+1
##            le=le+max((mulp-1)*mx,0)
##            c+=fm-l+1
##            le+=max(
            
##            for i in range(l,r+1):
##                x=(i%a)%b;y=(i%b)%a
##                if(x != y ):
##                    c+=1
##                    print(i,x,y)
##                else:
##                    print(i)
##            print(c)
##    print(min((abs(x-y)*a + min(x,y)*b),(x+y)*a))
