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 
# encoding: utf-8
import sys
sys.setrecursionlimit(10**6)


def gcd(a, b):
    while b != 0: r = b; b = a % b; a = r
    return a


def f(a, b, s, e):
    if a == b: return 0
    beishu = a * b // gcd(a, b)
    if a > b: a, b = b, a
    if s == 1: s = 0
    si = s // beishu
    if s % beishu != 0: si += 1
    start = si * beishu
    ei = e // beishu
    end = ei * beishu
    if start > e:
        start -= beishu
        start += b
        if e < start: return 0
        return e - max(start, s) + 1
    if end < s:
        end += b
        if e < end: return 0
        return e - max(end, s) + 1
    ans = 0
    ans += (beishu - b) * (ei - si)
    ne = start - 1
    start -= beishu
    start += b
    if e < start: pass
    else: ans += ne - max(start, s) + 1
    end += b
    if e < end: pass
    else: ans += e - end + 1
    return ans


def g(a, b, s, e):
    cnt = 0
    for i in range(s, e+1):
        if i%a%b != i%b%a: cnt+=1
        # else: print(i)
    if f(a, b, s, e) != cnt:
        print(a, b, s, e, f(a, b, s, e), cnt)


if __name__ == '__main__':
    # for b in range(2, 300):
    #     for a in range(3, 40):
    #         for s in range(4, 50):
    #             for e in range(s, 500):
    #                 g(a, b, s, e)
    # g(3, 2, 7, 9)
    # sys.stdin = open('1.txt', 'r')
    nofkase = int(input())
    for kase in range(nofkase):
        a, b, q = [int(i) for i in input().split()]
        for i in range(q):
            s, e = [int(i) for i in input().split()]
            print(f(a, b, s, e), end=' ')
        print("")