#include<bits/stdc++.h>
using namespace std;

const int nmax=500+42;

int n,m;

int inp[nmax][nmax];

struct node
{
    int i,j,h;
};
node given[nmax*nmax];

bool cmp(node a,node b)
{
    return a.h>b.h;
}

pair<int,int> parent[nmax][nmax];

bool print[nmax][nmax];

pair<int,int> root(pair<int,int> a)
{
    if(parent[a.first][a.second]==a)return a;
    parent[a.first][a.second]=root(parent[a.first][a.second]);
    return parent[a.first][a.second];
}

int outp[nmax][nmax];

pair<int,int> idle;

void my_merge(pair<int,int> u,pair<int,int> v,int h)
{
    u=root(u);
    v=root(v);

    if(u==idle||v==idle)return;

    if(u==v)return;

    if(inp[u.first][u.second]<inp[v.first][v.second])swap(u,v);

    outp[v.first][v.second]=inp[v.first][v.second]-h;

    //cout<<"my_merge "<<u.first<<" "<<u.second<<" "<<inp[u.first][u.second]<<" "<<v.first<<" "<<v.second<<" "<<inp[v.first][v.second]<<" "<<h<<endl;

    parent[v.first][v.second]=u;
}

int x_[4]={1,-1,0,0};
int y_[4]={0,0,1,-1};

int main()
{

    freopen("prominence2d.in","r",stdin);
    freopen("prominence2d.out","w",stdout);

    int pointer=0;

    scanf("%i%i",&n,&m);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            scanf("%i",&inp[i][j]);
            given[++pointer].i=i;
            given[pointer].j=j;
            given[pointer].h=inp[i][j];
        }

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            print[i][j]=1;

            for(int t=0;t<4;t++)
                if(inp[i+x_[t]][j+y_[t]]>inp[i][j])print[i][j]=0;
        }


    sort(given+1,given+pointer+1,cmp);

    for(int i=1;i<=pointer;i++)
    {
        int p=given[i].i;
        int q=given[i].j;

        parent[p][q]={p,q};

        for(int t=0;t<4;t++)
        {
            my_merge({p,q},{p+x_[t],q+y_[t]},given[i].h);
        }
    }

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(print[i][j])
            {
                if(outp[i][j]==0)outp[i][j]=inp[i][j];

                printf("%i\n",outp[i][j]);
            }
    return 0;
}