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 
def gcd(a, b):
    while a and b:
        if a > b:
            a %= b
        else:
            b %= a
    return a + b


t = int(input())
for ii in range(t):
    a, b, q = map(int, input().split())
    a, b = max(a, b), min(a, b)
    nok = a * b // gcd(a, b)
    #print(nok)
    for j in range(q):
        l, r = map(int, input().split())
        if a % b == 0:
            print(0, end=' ')
        else:
            cnt = 0
            if l % nok < a:
                cnt += min(a - l % nok, r - l + 1)
            left = (l // nok + 1) * nok
            if r >= left and r % nok < a:
                cnt += r % nok + 1
                right = (r // nok) * nok - 1
            else:
                right = r
            if right >= left:
                cnt += ((right // nok - left // nok + 1) * a)
            #print(left, right, cnt)
            print(r - l + 1 - cnt, end=' ')
    print()