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 sys
import math


def ii():
    return sys.stdin.readline().strip()


def idata():
    return [int(x) for x in ii().split()]


def solve_of_problem():
    a, b, q = idata()
    a, b = min(a, b), max(a, b)
    for i in range(q):
        l, r = idata()
        qw = a * b // math.gcd(a, b)
        z = (l - 1) // qw
        z1 = z * qw
        ans = r - min(max(l, z1 + b), r + 1) + 1
        if ans < z1 + qw - l:
            print(ans, end=' ')
        else:
            e = max(ans - (z1 + qw - l), 0)
            d, g = e // qw, min(e % qw, b)
            print(ans - d * b - g, end=' ')
    print()
    return


for ______ in range(int(ii())):
    solve_of_problem()