#include <math.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define print(n) cout << (n) << endl
#define fprint(n) cout << setprecision(16) << (n) << endl
#define ceil_div(a, b) (((a) - 1) / (b) + 1)
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define itrep(itr, st) for (auto itr = st.begin(); itr != st.end(); itr++)
#define ite(i, a) for (auto& i : a)
#define all(x) x.begin(), x.end()
#define lb(A, x) (lower_bound(all(A), x) - A.begin())
#define ub(A, x) (upper_bound(all(A), x) - A.begin())
using str = string;
using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using Pair = pair<int, int>;
using mint = modint1000000007;
using Mint = modint998244353;
template <class T>	using V = vector<T>;
template <class T>	using VV = V<V<T> >;
template <class T>	using PQ = priority_queue<T, V<T>, greater<T> >;
template <class T>	using PQR = priority_queue<T>;
template <class T>	using BIT = fenwick_tree<T>;
const ll INF = 4611686018427387903;
const int inf = 2147483647;
const ll mod = 1000000007;
const ll MOD = 998244353;
template <class T>  inline V<T> getList(int n) { V<T> res(n); rep(i, 0, n) { cin >> res[i]; }return res; }
template <class T>  inline VV<T> getGrid(int m, int n) { VV<T> res(m, V<T>(n)); rep(i, 0, m) { res[i] = getList<T>(n); }return res; }
template <class T> inline void prints(V<T>& vec) { if (vec.size() == 0)return; cout << vec[0];	rep(i, 1, vec.size()) { cout << ' ' << vec[i]; } cout << '\n'; }
inline V<int> dtois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - '0'); } return vec; }
inline V<int> atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'a'); } return vec; }
inline V<int> Atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'A'); } return vec; }


int main(void) {
	int n, m;	cin >> n >> m;
	VV<ll> a = getGrid<ll>(n, m);

	VV<pair<ll, ll> > dp(n, V<pair<ll, ll> >(m, { INF,INF }));
	dp[0][0].first = 0;
	PQ<V<ll> > que = {};	que.push({ 0ll ,0ll,0ll,0ll });
	while (que.empty() == false) {
		V<ll> vec = que.top();	que.pop();
		ll c = vec[0], p = vec[1], q = vec[2], r = vec[3];
		if ((r == 0 and c > dp[p][q].first) or (r == 1 and c > dp[p][q].second)) {
			continue;
		}
		if (p == n - 1) {
			print(c);
			break;
		}
		if (q > 0 and c < dp[p][q - 1].first) {
			dp[p][q - 1].first = c;
			que.push({ c, p, q - 1, 0 });
		}
		if (q < m - 1 and c < dp[p][q + 1].first) {
			dp[p][q + 1].first = c;
			que.push({ c, p, q + 1, 0 });
		}
		if (r == 0) {
			ll nc = c + a[p][q];
			if (nc >= dp[p][q].second) {
				continue;
			}
			dp[p][q].second = nc;
			que.push({ nc,p,q,1 });
		}
		else {
			ll nc = c + a[p + 1][q];
			if (nc >= dp[p + 1][q].second) {
				continue;
			}
			dp[p + 1][q].second = nc;
			que.push({ nc,p + 1,q,1 });
		}
	}				

	return 0;
}