// 2022 IUSB Programming Competition
// Round 1 Problem 6
// 2D-Array Traversal
// Solution by Liguo Yu

import java.util.Scanner;

public class round1_p6
{	
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        int m = input.nextInt();
        int n = input.nextInt();
        
        int[][] a = new int[m][n];
        for(int i=0; i<a.length; i++)
        {
            for(int j=0; j<a[0].length; j++)
            {
                a[i][j] = input.nextInt();
            }
        }  
       
        print(a, m, n);
    }
    
    public static void print(int[][] a, int row, int col)
    {
        for(int c=0; c<col; c++)
            System.out.print(a[0][c] + " ");
        
        if(row > 1)
        {
            int b[][] = new int[col][row-1];
            rotate_copy(a, b, row, col);
            print(b, col, row-1);
        } 
    }
    
    // copy array a to array b without first row
    // through counter-clockwise rotating 90 degrees
    public static void rotate_copy(int[][] a, int[][] b, int row, int col)
    {
        for(int i=1; i<row; i++)
        {
            for(int j=0; j<col; j++)
            {
                b[col-1-j][i-1] = a[i][j];
            }
        }
    }
}