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
def check(arr, a, b):
    d = []
    ll = a*b//math.gcd(a, b)
    for i in range(1, ll+1):
        if i%a%b != i%b%a:
            d.append(1)
        else:
            d.append(0)
   
    
    for i in range(1, len(d)):
        if d[i] == 1:
            d[i] = d[i-1] + 1
        else:
            d[i] = d[i-1]
    
    
    result = []
    last = d[-1]
    for l, r in arr:
        p = 1
        q = 1
        
        kk = last*(r//ll) - last*(l//ll)
       
        l -= 1
        r = r % ll
        if r == 0:
            p = 0
        else:
            r -= 1
        l = l % ll
        if l == 0:
            q = 0
        else:
            l -= 1
        
        result.append(p*d[r] - q*d[l] + kk)
    return result
            
        
    
    
            
    
t = int(input())
while t:
    a, b, q = list(map(int, input().split()))
    arr = []
    for i in range(q):
        arr.append(list(map(int, input().split())))
    result = check(arr, a, b)
    for i in result:
        print(i, end=" " )
    print()
        
    
   

    t-= 1
