#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int main()
{
    freopen("DATA5.txt", "r", stdin);
    freopen("OUT5.txt", "w", stdout);
    for (int l0 = 0; l0 < 5; l0++)
    {
        int n, p;
        int a[100][100] = {};
        int b[100][100] = {};
        cin >> n >> p;
        for (int l1 = 1; l1 <= n; l1++)
            for (int l2 = 1; l2 <= p; l2++)
            {
                cin >> a[l1][l2];
            }
        for (int l1 = 1; l1 < n; l1++)
            for (int l2 = 1; l2 <= p; l2++)
            {
                if ((l1 == 1) || (l1 == n) || (l2 == 1) || (l2 == p))
                    b[l1][l2] == 0;
                else
                {
                    int mini = 10000000;
                    if (a[l1 - 1][l2] + b[l1 - 1][l2] < mini) mini = a[l1 - 1][l2] + b[l1 - 1][l2];
                    if (a[l1][l2 - 1] + b[l1][l2 - 1] < mini) mini = a[l1][l2 - 1] + b[l1][l2 - 1];
                    b[l1][l2] = max(mini - a[l1][l2], 0);
                }
            }
        bool flag = 1;
        while (flag)
        {
            flag = 0;
            for (int l1 = 1; l1 < n; l1++)
                for (int l2 = 1; l2 <= p; l2++)
                {
                    int mini = 10000000;
                    if (a[l1 - 1][l2] + b[l1 - 1][l2] < mini) mini = a[l1 - 1][l2] + b[l1 - 1][l2];
                    if (a[l1][l2 - 1] + b[l1][l2 - 1] < mini) mini = a[l1][l2 - 1] + b[l1][l2 - 1];
                    if (a[l1 + 1][l2] + b[l1 + 1][l2] < mini) mini = a[l1 + 1][l2] + b[l1 + 1][l2];
                    if (a[l1][l2 + 1] + b[l1][l2 + 1] < mini) mini = a[l1][l2 + 1] + b[l1][l2 + 1];
                    if (b[l1][l2] > max(mini - a[l1][l2], 0))
                    {
                        b[l1][l2] = max(mini - a[l1][l2], 0);
                        flag = 1;
                    }
                }
        }
        int cnt = 0;
        for (int l1 = 1; l1 <= n; l1++)
            for (int l2 = 1; l2 <= p; l2++)
                cnt += b[l1][l2];
        cout << cnt << '\n';
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}

