Find the smallest N of at least 1 that minimizes the least common multiple of A+N and B+N.
You are given two natural numbers AAA and BBB. Find the natural number NNN that makes the least common multiple of A+NA + NA+N and B+NB + NB+N as small as possible.
The first line contains two natural numbers AAA and BBB, separated by a space. 1≤A,B≤1091 \le A, B \le 10^91≤A,B≤109.
Print NNN on the first line. If several values of NNN make the least common multiple minimal, print the smallest one.
A natural number is an integer of at least 1, so N≥1N \ge 1N≥1.