Let's consider a table consisting of *n* rows and *n* columns. The cell located at the intersection of *i*-th row and *j*-th column contains number *i* × *j*. The rows and columns are numbered starting from 1.

You are given a positive integer *x*. Your task is to count the number of cells in a table that contain number *x*.
The single line contains numbers *n* and *x* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *x* ≤ 10<sup class="upper-index">9</sup>) — the size of the table and the number that we are looking for in the table.
t=int(input())
cases = []
for i in range(t):
    cases.append([[int(x) for x in input().split()],[int(x) for x in input().split()]])

for case in cases:
    x,y = case[0][0], case[0][1]
    a,b = case[1][0], case[1][1]

    if x*y <= 0:
        print((abs(x)+abs(y))*a)
    else:
        print(min(abs(x-y)*a + (min(abs(x),abs(y)))*b,abs(x+y)*a))
