#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit | (1 << i))
#define BIT_OFF(bit, i) (bit & ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

// 2のべき乗数かどうか
bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};  // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};    // 右，下，左，上
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

template<class T=int> class Grid {
public:
    const int H;
    const int W;
    const int SPACE = 0;
    const int BLOCK = 1;

    std::vector<std::vector<T>> grid;

    Grid(int h, int w) : H(h), W(w) {
        this->grid.resize(this->H, std::vector<int>(this->W, this->SPACE));
    }

    void set(int y, int x, T s) {
        this->grid[y][x] = s;
    }

    std::vector<T> &operator[](int y) {
        return this->grid[y];
    }

    void show() {
        for (int y = 0; y < this->H; ++y) {
            for (int x = 0; x < this->W; ++x) {
                cout << this->grid[y][x] << " ";
            }
            cout << endl;
        }
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL H, W;
    cin >> H >> W;
    Grid<> grid(H, W);

    FOR(y, 0, H) {
        FOR(x, 0, W) {
            cin >> grid[y][x];
        }
    }

    auto used = make_v<bool>(H, W, H * W + 10);

    // cost, dist, y, x, bit
    priority_queue<tuple<LL, int, int, int>, vector<tuple<LL, int, int, int>>, greater<tuple<LL, int, int, int>>> que;
    que.emplace(make_tuple(0, 0, 0, 0));
    while (not que.empty()) {
        LL cost, dist, y, x;
        tie(cost, dist, y, x) = que.top(); que.pop();
        cost += dist;

        if (dist > H * W) {
            continue;
        }

        if (y == H - 1 and x == W - 1) {
            print(cost - dist);
            return 0;
        }

        if (used[y][x][dist]) {
            continue;
        }
        used[y][x][dist] = true;

        FOR(i, 0, 4) {
            const int ny = y + dy4[i];
            const int nx = x + dx4[i];

            if (not inside(ny, nx, H, W)) {
                continue;
            }

            // 移動
            if (grid[ny][nx] == 0) {
                LL new_cost = cost + 1;
                LL new_dist = dist + 1;
                que.emplace(make_tuple(new_cost - new_dist, new_dist, ny, nx));
            }
            else {
                // (ny, nx)の木をかってから移動
                LL new_cost = cost + grid[ny][nx] + grid[ny][nx] * dist * 2 + 1;
                LL new_dist = dist + 1;
                que.emplace(make_tuple(new_cost - new_dist, new_dist, ny, nx));
            }
        }
    }

    return 0;
}




Measured memory_bytes: 15384