# include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
const int maxn = 505;
int a[maxn][maxn];
int v[maxn][maxn];
int ans[maxn][maxn];
int n,m;
struct nodes
{
    int x,y,st;
    nodes(int __x, int __y, int __st)
    {
        x=  __x;
        y = __y;
        st = __st;
    }
};
vector <nodes> p;
bool cmp(nodes i, nodes j)
{
    return i.st>j.st;
}
int vis[maxn][maxn],ids = 1;
void dijkstra(int x, int y)
{
   // cout<<"*"<<x<<" "<<y<<endl;
    int px = x;
    int py = y;
    ids++;
    vis[x][y] = ids;
    priority_queue <pair <int, pair <int, int> > > q;
    q.push({a[x][y],{x,y}});
    while(!q.empty())
    {
        x = q.top().second.first;
        y = q.top().second.second;
        int t = q.top().first;
       // cout<<x<<" "<<y<<" "<<t<<endl;
        q.pop();
        int i = x-1;
        int j = y;
        if(i>0&&i<=n&&j>0&&j<=m)
        if(vis[i][j]!=ids)
        {
            vis[i][j] = ids;
            if(a[px][py]-min(a[i][j],t)<v[i][j])
            {
                v[i][j]=a[i][j]-min(a[i][j],t);

            }  q.push({min(a[i][j],t),{i,j}});
        }
         i = x+1;
         j = y;
        if(i>0&&i<=n&&j>0&&j<=m)
        if(vis[i][j]!=ids)
        {
            vis[i][j] = ids;
            if(a[px][py]-min(a[i][j],t)<v[i][j])
            {
                v[i][j]=a[i][j]-min(a[i][j],t);

            }q.push({min(a[i][j],t),{i,j}});
        }
        i = x;
         j = y-1;
       if(i>0&&i<=n&&j>0&&j<=m)
        if(vis[i][j]!=ids)
        {
            vis[i][j] = ids;
            if(a[px][py]-min(a[i][j],t)<v[i][j])
            {
                v[i][j]=a[i][j]-min(a[i][j],t);

            }  q.push({min(a[i][j],t),{i,j}});
        }
        i = x;
         j = y+1;
        if(i>0&&i<=n&&j>0&&j<=m)
        if(vis[i][j]!=ids)
        {
            vis[i][j] = ids;
            if(a[px][py]-min(a[i][j],t)<v[i][j])
            {
                v[i][j]=a[i][j]-min(a[i][j],t);

            } q.push({min(a[i][j],t),{i,j}});
        }
    }
}
int main()
{
      freopen ("prominence2d.in", "r", stdin);
freopen ("prominence2d.out", "w" , stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int i,j;
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            cin>>a[i][j];
            p.push_back(nodes(i,j,a[i][j]));
            v[i][j] = n*m;
        }

    }
    sort(p.begin(),p.end(),cmp);
    for(i=0;i<p.size();i++)
    {
        int x = p[i].x;
        int y = p[i].y;
        if(a[x-1][y]<a[x][y]&&a[x+1][y]<a[x][y]&&a[x][y-1]<a[x][y]&&a[x][y+1]<a[x][y])
        {
            ans[x][y] = v[x][y];

        }
        else
            ans[x][y] = -1;
             dijkstra(x,y);
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        if(ans[i][j]>0)
        cout<<ans[i][j]<<'\n';
    return 0;
}