Question $2$

In the Longest$-$Common$-$Subsequence problem, the following algorithm was proposed to come up with two matrices $b$ and $c$ which contain information that allows one to identify the solution:

If $x="$s pank ing" and $Y="$a m p u t a t i o n$"$ the algorithm would produce the following $c$ matrix:

What are the missing $33$ matrix entries at the lower right corner of the matrix?