Given two integers n and k, find a decomposition of n into k positive integers such that their product is equal to n.

Among all possible decompositions, choose the one that minimizes the difference between the maximum and minimum elements.

Return the k integers sorted in non decreasing order. If there are multiple valid answers, you may return any of them.

Constraints:

• $4 \leq$ n $\leq 10^5$

• $2 \leq$ k $\leq 5$

• k is strictly less than the total number of positive divisors of n.

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.