elementary number theory - Find the Bezout identity for $,gcd(14565695, 61489)$.

Find $m,n\in \Bbb{Z}$ such that $\,\gcd(14565695, 61489) = m\cdot 14565695 + n\cdot 61489.$

I used the Euclidean Algorithm to show the gcd $=1.$ What way is there to solve such a question?
I would appreciate your help.