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 
from sys import stdin, stdout
from math import ceil

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a%b)

t = int(input())
for _ in range(t):
    a, b, q = map(int, stdin.readline().split())

    if max(a, b)%min(a, b) == 0:
        for _ in range(q):
            l, r = map(int, stdin.readline().split())
            print(0)

    else:
        lcm = (a*b)//gcd(a, b)
        m = max(a, b)
        how = lcm - m
        ans = []
        for _ in range(q):
            l, r = map(int, stdin.readline().split())

            # From solution page. if b>=a, the statement is NOT satisfied for every LCM-b quantities. We have to find out how many LCM-b quantities exist in [l, r]. Find the quantity in [0, l-1]. Find it in [0, r]. Subtract the two to get [l, r]
            
            # for [0, l-1]
            x1 = ((l-1)//lcm)*how
            final1 = (l-1)%lcm
            x1 += max(0, final1 - b + 1)

            # repeat above steps for [0, r]
            x2 = ((r)//lcm)*how
            final2 = (r)%lcm
            x2 += max(0, final2 - b + 1)

            ans.append(x2-x1)
        print(*ans)