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 
t = int(input())

def compute_gcd(x, y):
   while(y):
       x, y = y, x % y
   return x

def compute_lcm(x, y):
    lcm = (x*y)//compute_gcd(x,y)
    return lcm

def computeResult(a, b, lcm, x, y):
    # x >= y
    first = a // lcm
    last = b // lcm
    # print(a, b, lcm, first, last)
    if first == last:
        if (a > first * lcm + x):
            return (b - a + 1)
        return (b - a + 1) - (min(b, first * lcm + x - 1) - (max(a, first * lcm) - 1))
    # print(lcm)
    # print(max((last - first - 1),0))
    # print(min(last * lcm + x, b) - last * lcm)
    # print(min(b, max(first * lcm + x, a)) - a)
    return (b - a + 1) - ((last - first - 1) * x + (min(last * lcm + x - 1, b) - (last * lcm - 1)) + max(first * lcm + x - 1, a - 1) - a + 1)

for i in range(t):
    (x, y, q) = [int(u) for u in input().split(' ')]
    lcm =compute_lcm(x, y)
    if (x < y):
        qw = x
        x = y
        y = qw
    results = ""
    for j in range(q):
        (a, b) = [int(u) for u in input().split(' ')]
        result = computeResult(a, b, lcm, x, y)
        results += str(result) + " "
    print(results)
