#include <stdio.h>

void main(void)
{
    int m, n;
    scanf("%d", &m);
    scanf("%d", &n);
    int data[m][n];
    int data2[n];
    for (int i = 0; i < n; i++) {
        data2[i] = 0;
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            scanf("%d", &data[i][j]);
        }
    }

    for (int j = 0; j < n; j++) {
        for (int k = 0; k < (m / 2); k++) {
            int d = 0;
            if (data[k][j] == data[m - k - 1][j]) {
                d++;
            }
            if (d == (m / 2)) {
                data2[j] = 1;
            }
        }
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            printf("%d", data[i][j]);
        }
        printf("\n");
    }

    for (int i = 0; i < n; i++) {
        printf("%d", data2[i]);
    }
    printf("\n\n");

    for (int k = 0; k < n; k++) {
        for (int j = 0; j < n - 1; j++) {
            if (data2[j] < data2[j + 1]) {
                int c = data2[j];
                data2[j] = data2[j + 1];
                data2[j + 1] = c;
                for (int i = 0; i < m; i++) {
                    int c = data[i][j];
                    data[i][j] = data[i][j + 1];
                    data[i][j + 1] = c;
                }
            }
        }
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            printf("%d", data[i][j]);
        }
        printf("\n");
    }

    for (int i = 0; i < n; i++) {
        printf("%d", data2[i]);
    }

    return;
}