You are in charge of preparing a recently purchased lot for the Company's building.
The lot is covered with trenches and has a single obstacle that needs to be taken down before the foundation is prepared for the building.
The demolition robot must remove the obstacle before the progress can be made on the building.

Assumptions
The lot is flat, except the trenches, and can be represented by a 2D grid.
The demolition robot must start at the top left corner of the lot, which is always flat, and can move on the block up, down, right, left
The demolition robot cannot enter trenches and cannot leave the lot.
The flat areas are indicated by 1, areas with trenches are indicated by 0, and the obstacle is indicated by 9

Input
The input consists of three arguments:
numRows: an integer represents the number of rows
numColumns: an integer represents the number of columns
lot: a 2d grid of integers

Output
Return an integer that indicated the minimum distance traversed to remove the obstacle else return -1

Constraints
1<= numRows
numColumns <= 1000

Examples
Input:
numRows = 3
numColumns = 3
lot = [
[1, 0, 0],
[1, 0, 9],
[1, 9, 1]
Output: 3
Explanation
Starting from the top-left corner, the demolition robot traversed the cells (0,0) -> (1,0)-> (2,0)->(2,1)
The robot moves 3 times to remove the obstacle 9