A small vineyard ages its wine in oak casks numbered with consecutive positive integers as they enter the cellar. Before a tasting rotation, the cellar master picks one cask whose number is at least a given starting id, and whose decimal digits multiply together to a total that divides evenly by the number of tasting stations set up that day (so the cask's contents can later be portioned into equal shares with nothing left over). Given the starting cask id n and the station count t, find the smallest valid cask number.

The digit product of a single-digit number is the digit itself. If any digit of a candidate number is 0, its digit product is 0, and 0 is considered divisible by every t.

Input format

A single line containing two integers n and t, separated by a space.

Output format

Print a single integer: the smallest integer m with m >= n such that the product of the decimal digits of m is divisible by t. Such an m always exists within a bounded distance of n.

Constraints

• 1 <= n <= 1000
• 1 <= t <= 10

5 7

7

15 3

16