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:
"""
    Author : thekushalghosh
    Team   : CodeDiggers
"""
import sys,math,cmath,time
start_time = time.time()

################# ---- USER DEFINED INPUT FUNCTIONS ---- #################
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(s[:len(s)])
def invr():
    return(map(int,input().split()))
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    a,b,q = invr()
    w = a * b // math.gcd(a,b)
    qw = []
    for i in range(w):
        if not qw:
            qw.append(0)
        qq = qw[-1]
        if ((i + 1) % a) % b != ((i + 1) % b) % a:
            qq = qq + 1
        qw.append(qq)
    qwqw = []
    for i in range(q):
        l,r = invr()
        l = l - 1
        lc = math.floor(l // w) * qw[-1]
        rc = math.floor(r // w) * qw[-1]
        qwqw.append(max(0,rc - lc + qw[r % w] - qw[l % w]))
    print(*qwqw)
    
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
def main():
    ONLINE_JUDGE = __debug__
    if not ONLINE_JUDGE:
        sys.stdin = open('input.txt','r')
        sys.stdout = open('output.txt','w')
    else:
        input = sys.stdin.readline
    t = 1
    t = inp()
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed:",time.time() - start_time,"seconds")

############## ---- USER DEFINED PROGRAMMING FUNCTIONS ---- ##############
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)

main()
sys.stdout.close()