Euclidean Algorithm for polynomials

I know how to use the extended euclidean algorithm for finding the GCD of integers but not polynomials. I can't really find any good explanations of it online. The question here is to find the GCD of
m(x) = $\ x^3+6x+7 $ and n(x) = $\ x^2+3x+2 $.

I try to use it the same way as for integers but don't really get anywhere and just get huge lines without ever reducing it and getting closer to finding the GCD.