#include <cstdio>
 int N, M, A[1005][1005];
 int main()
    {
    scanf("%d%d", &N, &M);
    for(int i = 1; i <= N; ++i)
     {
         A[i][0] = A[i][M+1] = -1;
             for(int j = 1; j <= M; ++j)
                scanf("%d",&A[i][j]);
        }
    
        for(int j = 1; j <= M; ++j)
            A[0][j] = A[N+1][j] = -1;
    
        int i = 1, j = 1, ok = 1;
        printf("%d ",A[i][j]); A[i][j] = -1;
        while(ok) {
            ok = 0;
            while(A[i][j+1] != -1) { ok = 1; ++j; printf("%d ", A[i][j]); A[i][j] = -1; }
            while(A[i+1][j] != -1) { ok = 1; ++i; printf("%d ", A[i][j]); A[i][j] = -1; }
            while(A[i][j-1] != -1) { ok = 1; --j; printf("%d ", A[i][j]); A[i][j] = -1; }
          while(A[i-1][j] != -1) { ok = 1; --i; printf("%d ", A[i][j]); A[i][j] = -1; }
        }
        return 0;
    }