Total number of unique path from (1,1) to (n * m) 2D grid.
Allowed move, top,bottom,right,left.

Follow up: if 2D grid is filled with some cost values, minimum cost to reach end cell from first cell.