Smallest Divisible Digit Product II

Given a string lo (lower bound) and integer n, find the smallest number >= lo such that the product of its non-zero digits is divisible by n.

Examples
Input: ["1",2]
Output: "2"
Hints

Smallest Divisible Digit Product II

Given a string lo (lower bound) and integer n, find the smallest number >= lo such that the product of its non-zero digits is divisible by n.