#include<stdio.h>
#include<algorithm>
#define inf 1500000000
using namespace std;
int s[201][505];
long long dp[201][505];
int n, m;
int main(){
long long ans = inf;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) dp[i][j] = inf;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) scanf("%d", &s[i][j]);
for(int i = 1; i <= m; i++) dp[1][i] = s[1][i];//第一层的最小伤害就是本身
for(int i = 2; i <= n; i++){
for(int j = 1; j <= m; j++)
dp[i][j] = min(dp[i][j], dp[i - 1][j] + s[i][j]);//从上到下dp
for(int j = 2; j <= m; j++)
dp[i][j] = min(dp[i][j], dp[i][j - 1] + s[i][j]);//从左到右dp
for(int j = m - 1; j > 0; j--)
dp[i][j] = min(dp[i][j], dp[i][j + 1] + s[i][j]);//从右到左dp
}
for(int i = 1; i <= m; i++)
ans=min(ans, dp[n][i]);
printf("%I64d\n", ans);
return 0;
}
//presented by 大吉大利,今晚AC