Starting number in the sequence

The sequence consists of $k$ natural numbers, where each pair of consecutive numbers differs by one. The first number in the sequence is $x$. Your task is to find the smallest natural number $s_1$ such that every number from $s_1$ onwards can be expressed as a sum of the form $a_1\cdot x+a_2\cdot (x+1)+\dots +a_k\cdot (x+k-1)$, where each $a_i$ is a natural number.

Input

You will receive two integers, $x$ and $k$, separated by a space, from the standard input. The constraints are $1\le x\le 1000$ and $3\le k\le 1000$.

Output

Print the smallest natural number $s_1$ to the standard output.

Examples