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 
t = int(input())
for _ in range(t):
    a, b, q = list(map(int, input().rstrip().split(" ")))
    resArr = []
    fullCount = 0
    
    for x in range(a * b):
        x1 = x % a % b
        x2 = x % b % a
        if x1 == x2:
            resArr.append(0)
        else:
            resArr.append(1)
            fullCount += 1
    prev = 0
    resArr2 = []
    
    for i in range(len(resArr)):
        resArr2.append(prev + resArr[i])
        prev = resArr2[i]
    

    #print(f'resArr : {resArr}\nresArr2 : {resArr2}\nfullCount : {fullCount}\n')
    outList = []
    for _ in range(q):
        out = 0
        l, r = list(map(int, input().rstrip().split(" ")))
        numCount = (r - l + 1) // (a * b) 
        if r - l + 1 % (a * b) != 0:
            idxL = l % (a * b)
            idxR = r % (a * b)
            #print(f'idxL : {idxL} | idxR : {idxR}')
            if idxR > idxL:
                if idxL == 0:
                    temp = 0
                else:
                    temp = resArr2[idxL - 1]
                out += resArr2[idxR] - temp
            elif idxL > idxR:
                out += resArr2[-1] - resArr2[idxL - 1] + resArr2[idxR]
        
        out += fullCount * numCount
        outList.append(str(out))
    print(' '.join(outList))