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 
# Contest No.: Edu 86
# Problem No.: C
# Solver:      JEMINI
# Date:        20200426

import sys

def gcd(a: int, b: int) -> int:
    if a < b:
        a, b = b, a
    if b == 0:
        return a
    else:
        return gcd(b, a % b)

def main():
    t = int(input())
    for _ in range(t):
        a, b, q = map(int, sys.stdin.readline().split())
        flag = None
        modVal = None
        if a == 1 or b == 1 or a == b:
            flag = 0
        elif max(a, b) % min(a, b) == 0:
            flag = 1
            modVal = min(a, b)
        else:
            flag = 2
            modVal = a * b // gcd(a, b)
            checkList = [0] * modVal
            loopSum = 0
            for i in range(modVal):
                if ((i % a) % b) != ((i % b) % a):
                    loopSum += 1
                    checkList[i] = loopSum
        
        for i in range(q):
            x, y = map(int, sys.stdin.readline().split())
            if flag == 0:
                print(0, end = " ")
            elif flag == 1:
                ans = y - x + 1
                ans = ans - y // modVal + x // modVal
                if not x % modVal:
                    ans -= 1
                print(ans, end = " ")
            else:
                def calcSum(n: int) -> int:
                    if n < modVal:
                        return checkList[n]
                    else:
                        return checkList[-1] * (n // modVal) + checkList[n % modVal]
                ans = calcSum(y) - calcSum(x - 1)
                print(ans, end = " ")
        print("")
    return

if __name__ == "__main__":
    main()