Java implementation to find the minimum number of operations required to move from ( 1 , 1 ) to ( N , M )
import java . lang . * ; import java . util . * ; class GFG { static final long MAX = ( long ) 1e18 ; static long n , m ; static List < List < Long > > v = new ArrayList < > ( 151 ) ; static long [ ] [ ] dp = new long [ 151 ] [ 151 ] ;