+483 Find the number of paths from A to B in the grid below, so that
* Each step is down or to the right.
* The path cannot pass through any point more than once.
An example path is shown.
The grid is 3 by 3, with A at the upper-left, and B at the lower-right.
