// Program 18: Sort Alternate Matrix Rows

import java.util.*;
class AlternateRows {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        int n = sc.nextInt();
        if (m < 3 || m > 10 || n < 1 || n > 7) {
            System.out.println("Invalid order");
            return;
        }
        int[][] a = new int[m][n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                a[i][j] = sc.nextInt();
            }
        }
        for (int i = 0; i < m; i++) {
            for (int j = 1; j < n; j++) {
                int key = a[i][j];
                int k = j - 1;
                while (k >= 0 && ((i % 2 == 0 && a[i][k] > key) || (i % 2 == 1 && a[i][k] < key))) {
                    a[i][k + 1] = a[i][k];
                    k--;
                }
                a[i][k + 1] = key;
            }
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                System.out.print(a[i][j] + " ");
            }
            System.out.println();
        }
    }
}