Problem #8
This month we have two related problems.

How many ways are there to move from point A to point B in
the 8×8 grid shown below if you must move along the lines shown and
always proceed to the east, north, or northeast (i.e so that the
x and y coordinates do not decrease?)

What about the analogous question for an 8×8×8 grid? To be
more precise: how many ways are there to go from (0,0,0) to (8,8,8) so
that at each "step" at least one of the coordinates must increase by 1
and no coordinate can increase by more than 1?