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 math import ceil, floor
from sys import stdin

input = stdin.readline


def gcd(x, y):
    rem = x % y
    return y if not rem else gcd(y, rem)


if __name__ == '__main__':
    for _ in range(int(input())):
        a, b, q = map(int, input().split())

        tmp = min(a, b)

        b = max(a, b)
        a = tmp

        if not b % a:
            for _ in range(q):
                input()
                print(0)
            continue

        lcm = a * b // gcd(a, b)

        arr = []

        for i in range(lcm + 1):
            if i <= a:
                arr.append(0)
            else:
                arr.append(int(not ((i % a) % b) == ((i % b) % a)))

        cs = 0

        for i in range(lcm + 1):
            cs += arr[i]
            arr[i] = cs

        aarr = []

        for _ in range(q):
            l, r = map(int, input().split())

            ll = floor(l / lcm)
            hl = ceil(l / lcm)

            lr = floor(r / lcm)
            hr = ceil(r / lcm)

            base = ((lr * lcm - hl * lcm) // lcm) * cs if lr >= hl else 0

            base += cs - arr[l - ll * lcm - 1] if ll < hl <= lr else 0
            base += arr[r - lr * lcm]

            aarr.append(base)

        print(*aarr)
