Given three integers k, digit1, and digit2, find the smallest integer strictly greater than k that is a multiple of k and whose decimal representation consists only of the digits digit1 and digit2.

Return this integer, or return $-1$ if no such integer exists.

Constraints:

• $1 \leq$ k $\leq 1000$

• $0 \leq$ digit1 $\leq 9$

• $0 \leq$ digit2 $\leq 9$

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.