#include <bits/stdc++.h>
using namespace std;
int n,m;
int mincost(int a[][1000],int i,int j)
{
if(i>n-1 || j>m-1){return 0; }
int first=a[i][j]+mincost(a,i,j+1);
int second=a[i][j]+mincost(a,i+1,j);
return min(first,second);
}
int main() {
cin>>n>>m;
int a[1000][1000];
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>a[i][j];
}
}
cout<<mincost(a,0,0);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbixtOwppbnQgbWluY29zdChpbnQgYVtdWzEwMDBdLGludCBpLGludCBqKQp7CgoJaWYoaT5uLTEgfHwgaj5tLTEpe3JldHVybiAwOyB9CgoKaW50ICBmaXJzdD1hW2ldW2pdK21pbmNvc3QoYSxpLGorMSk7CmludCBzZWNvbmQ9YVtpXVtqXSttaW5jb3N0KGEsaSsxLGopOwpyZXR1cm4gbWluKGZpcnN0LHNlY29uZCk7Cgp9CgoKaW50IG1haW4oKSB7CgoJIGNpbj4+bj4+bTsKCWludCBhWzEwMDBdWzEwMDBdOwoJZm9yKGludCBpPTA7aTxuO2krKykKCXsKCQlmb3IoaW50IGo9MDtqPG07aisrKQoJCXsKCQkJY2luPj5hW2ldW2pdOwoJCX0KCQkKCX0KCQpjb3V0PDxtaW5jb3N0KGEsMCwwKTsKCgkgICAgCglyZXR1cm4gMDsKfQ==