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 math

t = int(input())

def gcd(a,b):
    while(b!=0):
        a,b = b,a%b    
    return a

for _ in range(t):
    a,b,q = map(int, input().split())
    boiled_down_to = [ 0 for x in range(a*b)]
    
    for i in range(1,a*b):
        boiled_down_to[i]=boiled_down_to[i-1]
        
        if( (i%a)%b != (i%b)%a ):
            boiled_down_to[i]+=1
        #print(i,boiled_down_to[i],end='')
        #print(' ' ,end='')
         
    prod=a*b
    sm= boiled_down_to[-1]
    for _ in range(q):
        l,r= map(int, input().split())   
        
        temp = (r) // (a*b)
        ans = sm * temp + boiled_down_to[(r) % (a*b)]
        temp = (l-1) // (a * b)
        ans -= (sm * temp + boiled_down_to[(l-1) % (a*b)])
            
        print(ans,end=' ')
        
    print()
        


'''
t = int(input())

def gcd(a,b):
    while(b!=0):
        a,b = b,a%b    
    return a

for _ in range(t):
    a,b,q = map(int, input().split())
    lcm = (a//gcd(a,b))*b
    
    for _ in range(q):
        l,r= map(int, input().split())
        
        if(a<=b):
            if(r<b):
                print(0,end=' ')
                
            elif(l<b):
                non = r//lcm - b//lcm
                if(non!=0):
                    non =  (non-1)*(b) + min(b,r%lcm)
                count = r-b+1 -non
                print(count, end=' ')
                
            else:
                non = r//lcm - l//lcm
                if(non!=0):
                    non =  (non-1)*(b) + min(b,r%lcm)
                count = r-l+1 -non
                print(count, end=' ')
                
        else:
            if(r<a):
                print(0,end=' ')
                
            elif(l<a):
                non = r//lcm - a//lcm
                if(non!=0):
                    non = non+ (non-1)*(a-1) + min(a-1,r%lcm)
                count = r-a+1 -non
                print(count, end=' ')
                
            else:
                non = r//lcm - l//lcm
                if(non!=0):
                    non = non+ (non-1)*(a-1) + min(a-1,r%lcm)
                count = r-l+1 -non
                print(count, end=' ')
                
                
    print()
'''    
