I'm no pro at modular arithmetic, but here is a link that my help; https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm
You could find the GCF, and then use that to come up with values for x and y?
Also, you could ask a mod or other genius users like EP and heureka (just to name a few. Everyone is smart in their own way :D) about this question by linking this question into a private message to them.
:)