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 
from sys import stdin

t = int(input())

for _ in range(t):
    a, b, q = list(map(int, stdin.readline().rstrip().split(" ")))
    prefixArr = [0] * (a * b)

    for i in range(a * b - 1):
        flag = 0
        if (i + 1) % a % b != (i + 1) % b % a:
            flag = 1
        prefixArr[i + 1] = prefixArr[i] + flag
    
    #print(*prefixArr)
    out = []
    for _ in range(q):
        l, r = list(map(int, stdin.readline().rstrip().split(" ")))
        count = 0
        q = (r - l + 1) // (a * b)
        count += (q  * prefixArr[-1]) 
        rem = (r - l + 1) % (a * b)
        
        LHl = (l) % (a * b)
        RHr = (r) % (a * b)
    
        if RHr >= LHl:
            if LHl > 0:
                count += prefixArr[RHr] - prefixArr[LHl - 1]
            else:
                count += prefixArr[RHr]
        else:
            if LHl > 0:
                count += prefixArr[-1] - prefixArr[LHl - 1]
            if RHr < (a * b - 1):
                count += prefixArr[RHr]


        
        out.append(count)
    print(*out)

'''
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
0 0 0 0 0 0 1 1 1 1 1  1  0  0  0  0  0  0  1  1  1  1  1  1
0 0 0 0 0 0 1 2 3 4 5  6  6  6  6  6  6  6  7  8  9  10 11 12
'''