PHP Function

A person starts from the uppermost, leftmost corner of a grid. Each cell of grid is 0,1,2,3,4,5,6 or 7. From any cell, he can only go to right cell if this cell is 1, he can only go to lower cell if this cell is 2, he can only go to its diagonally opposite cell if this cell is 3, he can go to right and lower cell if this cell is 4, he can go to right and diagonally opposite cell if this cell is 5, he can go to lower and diagonally opposite cell if this cell is 6, he can go to right and lower and diagonally opposite cell if this cell is 7 and he can not move from this cell if this cell is 0.

view the image here:

http://www.techgig.com/files/nicUploads/849880829644419.png

Person wants to go to the lowermost, rightmost corner of the grid.

Input1: An Integer array having two elements: m, n that depict rows and columns of the grid respectively

Input2: An Integer array containing m*n elements

Examples:

Input1: {4,6}

Input2: {1,3,0,0,0,0,0,0,4,5,1,0,0,0,0,6,7,6,0,0,0,0,5,0}

http://www.techgig.com/files/nicUploads/791576448995418.png

Need to write a function to calculate the total no. of paths which can be found.

function no_of_path($input1,$input2) { //Write code here }