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(n, m):
    if m==0:return n
    else: return Gcd(m, n%m)
def Lcm(n, m):
    return int((n*m)//Gcd(n,m))
t = int(input())
while t!=0:
    a, b, q = map(int, input().split())
    dl = Lcm(a, b)
    if a < b:a, b = b, a
    n = int(q)
    ar = list()
    while q != 0:
        L, R = map(int, input().split())
        L = max(L, a)
        num = int(0)
        if (L<=R) and (a%b)!=0:
            L = L - 1
            cut = int(L//dl)
            d = (L+1) - (cut*dl)
            if d <= a and cut>0:
                L -= d
                cut = cut - 1
            L -= cut*a
            cut = int(R//dl)
            d = (R+1) - (cut*dl)
            if (d <= a) and cut>0:
                R -= d
                cut = cut - 1
            R -= cut*a
            num = R - L
        ar.append(int(num))
        q = q - 1
    for i in range(0, n):
        print(ar[i], end=' ')
    print('\n')
    t = t - 1
