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 gcd(a, b):
    while b > 0:
        a, b = b, a % b
    return a


def lcm(a, b):
    return int(a * b / gcd(a, b))

tests = int(input())
for i in range(0, tests):
    first = input().split()
    a = int(first[0])
    b = int(first[1])
    q = int(first[2])
    low = a
    high = b
    if(a > b):
        low = b
        high = a
    for j in range(0, q):
        second = input().split()
        wrong = 0
        l = int(second[0])
        r = int(second[1])
        common = lcm(a,b)
        bottom = l//common
        top = r//common
        total = (r-l+1)
        if(high - (l%common) > 0):
            wrong = wrong + (high - (l%common) -1)
        n = 1
        while((bottom + n) * common <= r):
            if(r - (bottom + n) * common > 0):
                if(r - (bottom + n) * common <= high):
                    wrong = wrong + (r - (bottom + n) * common)
                else:
                    wrong = wrong + (high)
            n = n+1
        result = total - wrong
        if(result >0):
            print(result)
        else:
            print(0)