#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>
#include <string>
#include <vector>
#include <stdio.h>
#include <queue>

#define LL long long
#define pb push_back
#define lm 16005
#define MOD 1000000007

using namespace std;
int a[1005][1005];
int n,m;

int main()
{

    //freopen("data.txt", "r", stdin);
    scanf("%d%d",&n,&m);

    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
    {
        scanf("%d",&a[i][j]);
    }
    int i=1,j=1;
    bool ok=true;
    while(ok)
    {
        ok=false;
        while(a[i][j])
        {
            printf("%d ",a[i][j]);
            a[i][j]=0;
            j++;
            ok=true;
        }
        j--;
        i++;
        while(a[i][j])
        {
            printf("%d ",a[i][j]);
            a[i][j]=0;
            i++;
            ok=true;
        }
        i--;
        j--;
        while(a[i][j])
        {
            printf("%d ",a[i][j]);
            a[i][j]=0;
            j--;
            ok=true;
        }
        j++;
        i--;
        while(a[i][j])
        {
            printf("%d ",a[i][j]);
            a[i][j]=0;
            i--;
            ok=true;
        }
        i++;
        j++;
    }


    return 0;
}