Saviours Play Game

Time is ticking fast and Mumbai is at risk. Sartaj and Majid need to save the city. In order to get themselves ready, they decided to play a special game. The game is represented as a matrix A with $N$ rows and $M$ columns and $N$*$M$ cells. Let the cell $A[i][j]$ represents the points gain when some player reaches $ith$ row and $jth$ column. We are assuming 1-based indexing. Sartaj starts at