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 main():
    t = int(input())
    while t > 0:
        a, b, q = input().split(' ')
        a = int(a)
        b = int(b)
        q = int(q)
        if a > b:
            a, b = b, a
        gc = math.gcd(a, b)
        lc = a * b // gc
        cnt = 0
        for i in range(0, lc):
            if i % a % b == i % b % a:
                cnt += 1
        while q > 0:
            q -= 1
            l, r = input().split()
            l = int(l)
            r = int(r)
            ans = int(r - l + 1)
            if l % lc < cnt:
                ans -= min(cnt - l % lc, r - l + 1)
            l += lc - l % lc
            if l > r:
                print(ans, end=' ')
                continue
            ans -= (r - l + 1) // lc * cnt
            ans -= min(cnt, ((r - l + 1) % lc))
            print(ans, end=' ')
        print()
        t -= 1


if __name__ == '__main__':
    main()
