import java.util.*;
public class Main {
    public int[] solution(int[] skills) {
        int N = skills.length;
        int[] results = new int[N]; 
        List<Integer> e = new ArrayList<>(); 
        for (int i = 0; i < N; i++) {
            e.add(i);
        }
        int round = 1;
             while (e.size() > 1) {
            List<Integer> r = new ArrayList<>();  
                for (int i = 0; i < e.size(); i += 2) {
                int player1 = e.get(i);
                int player2 = e.get(i + 1);
                if (skills[player1] > skills[player2]) {
                    results[player2] = round;
                    r.add(player1); 
                } else {
                    results[player1] = round;
                    r.add(player2);
                }
            }
            e = r;
            round++;
        }
        results[e.get(0)] = round - 1; 
        return results;
    }

def whereIsPrincessPeach(m):
    if not m or not m[0]:
        return 7
    r,c=len(m),len(m[0])
    dp=[[0]*c for _ in range(r)]
    dp[0][0]=m[0][0]
    for i in range(1,c):
        dp[0][i]=dp[0][i-1]+m[0][i]
    for i in range(1,r):
        dp[i][0]=dp[i-1][0]+m[i][0]
    for i in range(1,r):
        for j in range(1,c):
            dp[i][j]=max(dp[i-1][j],dp[i][j-1])+m[i][j]
    return max(7,-dp[r-1][c-1]+1)

def main():
    r,c=map(int,input().split())
    m=[list(map(int,input().split())) for _ in range(r)]
    print(whereIsPrincessPeach(m))

if __name__=="__main__":
    main()

def photoAlbum(idx, identity):
    n = len(idx)
    album = []
    for i in range(n):
        album.insert(idx[i], identity[i])
    return album

def solve(n,k,nums):
    mxS=max(0,max(nums))
    cS=0
    for i in range(n):
        cS=max(0,cS+nums[i])
        if i>=k:
            mxS=max(mxS,cS)
    return mxS

public static int solution(int[] A, int[] B) {
        int MAX_SIDE = 500;
        int[][] frequency = new int[MAX_SIDE + 1][MAX_SIDE + 1];
        
        for(int i = 0; i < A.length; i++) {
            int a = A[i];
            int b = B[i];
            if(a < 1 || a > MAX_SIDE || b < 1 || b > MAX_SIDE) {
                continue;
            }
            frequency[a][b]++;
            if(a != b) {
                frequency[b][a]++;
            }
        }
        
        int maxSubset = 0;
        
        for(int s = 1; s <= MAX_SIDE; s++) {
            for(int t = 1; t <= MAX_SIDE; t++) {
                if(t + 1 > MAX_SIDE) {
                    if(frequency[s][t] > maxSubset) {
                        maxSubset = frequency[s][t];
                    }
                } else {
                    int currentCount = frequency[s][t] + frequency[s][t + 1];
                    if(currentCount > maxSubset) {
                        maxSubset = currentCount;
                    }
                }
            }
        }
        
        return maxSubset;
    }