Problem: 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 

Solution (in PYTHON3):

Solution:
q = int(input())

for _ in range(q):
    a, b, q1 = map(int, input().split())
    s = [0]*(a*b)
    for x in range(a*b):
        s[x] = 1 if (x%a)%b != (x%b)%a else 0
    for i in range(1, a*b):
        s[i] += s[i-1]
    
    for q_ in range(q1):
        l, r = map(int, input().split())
        li = l%(a*b)
        lsum = s[-1]-s[li-1] if li else s[-1]
        l += (a*b)-li+1
        sz = r-l+1
        msum = (sz//(a*b))*s[-1]
        ri = r%(a*b)
        rsum = s[ri]
        print(lsum+msum+rsum, end=" ")
    print()