Unique Paths III

In a grid, 1 is the start, 2 is the end, 0 is an empty cell that must be walked over and -1 is an obstacle. Print the number of 4-directional paths from the start to the end that visit every non-obstacle cell exactly once.

1 <= R * C <= 20