def gcd(a, b):
    while b:      
        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd(a, b)

a, b = map(int, raw_input().split())
if(a > b):
    c = a
    a = b
    b = c

l = b-2*a
for n in range(0, b-2*a):
    an = a + n
    bn = b + n
    lc = lcm(an, bn)
    if(lc < l):
        l = lc
print l