Calculation of Bezout's coefficients for $k$-ary algorithm of greatest common divisor

Bezout's equation is a representation of the greatest common divisor $d$ of two integers $A$ and $B$ as a linear combination $Ax+By=d$, where $x$ and $y$ are integers called Bezout's coefficients. Usually Bezout's coefficients are caclulated using the extended version of the classical Euclidian algorithm.
We elaborate a new algorithm for calculating Bezout's coefficients based on the $k$-ary GCD algorithm. This problem has numerous applications in the number theory and cryptography, for example, for calculation of multiplicative inverse elements in modular arithmetic.