The first polynomial, λΛ(x) = 7x^2+7x+9 is the error locator polynomial. The second polynomial, λΩ(x) = 3x+14, is used for calculating error values. Although not required, a common convention for Λ(x) is that the least significant term of Λ(x) is defined to be 1 (as opposed to the most significant term). In the example, the least significant term of λΛ(x) = 7x^2+7x+9 is the 9, so λ=9, and both polynomials are divided by λ=9. This results in (7x^2+7x+9)/9 = 14x^2+14x+1, and (3x+14)/9 = 6x+15.
A similar thing is shown in the wiki article, which uses GF(929), a non-binary field, in it's examples. In the wiki's extended Euclid example, both polynomials are divided by 544.
https://en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_correction#Euclidean_decoder
Comments about the white paper.
The Forney equation 21 on page 21 has an X^(1-b) term, which the paper notes can be ignored in the case b=1, but in the worked examples, b=0, so that X term is needed for the calculations as shown in the paper.
Some Reed Solomon implementations use a non-binary field, such as GF(929) as shown in the wiki article examples, and which is used for PDF417 barcodes. In this case, it's important to pay attention to addition versus subtraction, the signs of terms in equations, and the derivative of Λ(x) follows normal convention, the derivative of aX^b = abX^(b-1) with all math modulo 929. The wiki article examples show this.