Euclid's algorithm

Find linear representation of $\gcd(86110, 66817)$ using extended Euclid's algorithm and enter the coefficients (the coefficient corresponding to $86110$ first, the coefficient corresponding to $66817$ second). Note that, generally speaking, there exist infinitely many representations of $\gcd$, but the one which the algorithm finds is unique.