Starting number in the sequence#9533

Starting number in the sequence

1 second
128 megabytes
Easy

The sequence consists of natural numbers, where each pair of consecutive numbers differs by one. The first number in the sequence is . 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 x + a_2 (x+1) + \ldots + a_k (x+k-1), where each a_i is a natural number.

Input

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

Output

Print the smallest natural number s_1 to the standard output.

Examples

Example 2

Loading
Loading