Hi Codeforces, I have a problem where the solution is to solve diofant equation with K unknowns and K > 2. For example one equation of this type is: a1 * x + a2 * y + a3 * z = n and I have to find one solution of x, y and z. It is guaranteed that the equation always have a solution. Are there any algorithm that solve this problem? I will be thankful for helping :)