Given a m * n matrix, your task is to compute a path from any element on the 1 st column to any element on the last column at minimal cost. the path consists of several steps, each step is moving from column j to column j 1 in an adjacent (horizontal or diagonal) row. the first row and the last row are considered as adjacent rows. the cost of a path is the sum of visited integers.