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, stdout
from sys import maxsize
input = stdin.readline
# def print(n):
#    stdout.write(str(n)+'\n')


def solve():
    pass


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


def gcd(*args):
    n = len(args)
    ans = args[0]
    for i in range(1, n):
        ans = gcd1(ans, args[i])
    return ans


test = 1
test = int(input().strip())
for t in range(0, test):
    # n = int(input().strip())
    # s = list(input().strip())                                                        # String Input, converted to mutable list.
    a, b, q = list(map(int, input().strip().split()))
    a, b = min(a, b), max(a, b)
    # print(a,b)
    for i in range(q):
        l, r = list(map(int, input().strip().split()))
        x = a*b//gcd(a, b)
        if(r-l+1 <= b):
            count = 0
            for i in range(l, r+1):
                if(i % a != (i % b) % a):
                    count += 1
            print(count, end=' ')
        else:
            n1 = math.ceil(l/x)
            n2 = (r+1-b)//x
            count = 0
            count += (n2-n1+1)*(b-1)
            if(n2 < n1):
                count = 0
                for i in range(l, r+1):
                    if(i % a != (i % b) % a):
                        count += 1
                print(count, end=' ')
            else:
                count = 0
                for i in range(l, n1*x):
                    if(i % a != (i % b) % a):
                        count += 1
                for j in range(n2*x+b, r+1):
                    if(j % a != (j % b) % a):
                        count += 1
                print(count, end=' ')
    print()
    # arr = [int(x) for x in input().strip().split()]
    # brr = [list(map(int,input().strip().split())) for i in range(rows)]              # 2D array row-wise input
    ans = solve()


'''
rows, cols = (5, 5)
arr = [[0]*cols for j in range(rows)]                                         # 2D array initialization
b=input().strip().split()                                                             # list created by spliting about spaces
brr = [[int(b[cols*i+j]) for j in range(cols)] for i in range(rows)]          # 2D array Linear Input
rows,cols=len(brr),len(brr[0])                                                # no of rows/cols for 2D array
arr.sort(key = lambda x : x[1])                                               # sort list of tuples by 2nd element, Default priority - 1st Element then 2nd Element
s=set()                                                                       # empty set
a=maxsize                                                                     # initializing infinity
b=-maxsize                                                                    # initializing -infinity
mapped=list(map(function,input))                                              # to apply function to list element-wise
try:                                                                          # Error handling
    #code 1
except:                                                                       # ex. to stop at EOF
    #code 2 , if error occurs
'''
