Prove that having three distinct solutions of the conguence , where are known and is a product of distinct primes, we can find and efficiently.

I've managed to prove, with the Chinese remainder theorem, that the congruence always has four distinct solutions and that we can easily find the fourth solution when we have three.