Same Old Matrix Problem

You are given a matrix with N rows and M columns. Cell (x, y) indicates the cell at the intersection of xth row and yth column. Each cell of matrix contains some assigned value (say H). Visiting this cell, you will get H dollars (if H ≥ 0) else you have to pay |H| dollars. You start from cell (1, 1) and you have to reach cell (N, M). From a given cell, you can only move right or down. Formally, fr