Multiplication shift cipher with k-graphs

Ok, I've been looking at a worked example of a question I can't understand what's going on a certain point. There is a multiplier of 17, a shift 41 and k=2. PA needs to be enciphered. P has the value of 16 and A has the value of 1.

PA is converted to a pair with the sum: 16 x 62 + 1 = 993

Multiply: 993 x 17 = 16881

Shift: +41 = 16992

[working in modulo 62^2] 16992 (mod 62^2) = 1546

Now, here's where i'm confused, the next step just says "separate codes" and then gives the values of 24 and 58.

So if someone could explain how those two numbers were calculated that would be great, thanks.