Given two integers n and t, return the smallest integer greater than or equal to n such that the product of its digits is divisible by t.

Constraints:

• $1 \leq$ n $\leq 100$

• $1 \leq$ t $\leq 10$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.