#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 BIT_ON(bit, i) (((bit >> i) & 1) > 0)
#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; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
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;

class Grid {
public:
    const int H;
    const int W;
    const int SPACE = 0;
    const int BLOCK = 1;

    std::vector<std::vector<int>> 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, int s) {
        this->grid[y][x] = s;
    }
};

int bc[] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 };

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

    LL H, W;
    cin >> H >> W;
    Grid grid(H + 10, W + 10);

    FOR(y, 0, H) {
        FOR(x, 0, W) {
            char c;
            cin >> c;
            if (c == '.') {
                grid.set(y + 1, x + 1, 0);
            }
            else {
                grid.set(y + 1, x + 1, c - '0');
            }
        }
    }

    auto dp = make_v<LL>(H + 10, W + 10, 1 << 4);
    fill_v(dp, INF);

    dp[1][1][15] = 0;
    FOR(i, 1, H + 1) {
        FOR(j, 1, W + 1) {
            FOR(state, 0, 1 << 4) {
                // down
                FOR(new_state, 0, 1 << 4) {
                    if (((state & 4) == 0) != ((new_state & 8) == 0)) {
                        continue;
                    }
                    if (not (state & 2)) {
                        continue;
                    }
                    if (bc[state & 1] + bc[new_state & 6] <= 1) {
                        continue;
                    }

                    LL cost = dp[i][j][state];
                    if (new_state & 1) cost += grid.grid[i + 2][j - 1]; // 左下
                    if (new_state & 2) cost += grid.grid[i + 2][j];     // 下
                    if (new_state & 4) cost += grid.grid[i + 1][j + 1]; // 右

                    chmin(dp[i + 1][j][new_state], cost);
                }

                // right
                FOR(new_state, 0, 16) {
                    if (((state & 2) == 0) != ((new_state & 1) == 0)) {
                        continue;
                    }
                    if (!(state & 4)) {
                        continue;
                    }
                    if (bc[state & 8] + bc[new_state & 6] <= 1) {
                        continue;
                    }

                    LL cost = dp[i][j][state];
                    if (new_state & 8) cost += grid.grid[i - 1][j + 2];
                    if (new_state & 4) cost += grid.grid[i][j + 2];
                    if (new_state & 2) cost += grid.grid[i + 1][j + 1];

                    chmin(dp[i][j + 1][new_state], cost);
                }
            }
        }
    }

    print(dp[H][W][15]);

    return 0;
}




Measured memory_bytes: 174588