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 
import math
from sys import stdin
input = stdin.readline

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

    if a > b:
        a, b = b, a

    bb = b
    
    g = math.gcd(a, b)
    m = a // g
    gg = b * m

    for x in range(q):
        l, r = map(int, input().split())

        m1, m2 = l // gg, r // gg
        n1, n2 = l % gg, r % gg

        if m1 != m2:
            c1 = 0 if (bb - n1) < 0 else bb - n1
            c2 = bb if (n2 + 1) > bb else n2 + 1
            pp = m2 - m1 - 1
            ga = c1 + c2 + pp * bb

        else:
            if n2 > b - 1:
                n2 = b - 1

            ga = 0 if n2 - n1 + 1 < 0 else n2 - n1 + 1

        print(r - l + 1 - ga, end = ' ')

    print()