#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 20;
int dx[7] = {-1, 0, 1, 0, 0}, dy[N] = {0, 1, 0, -1, 0};
char g[N][N];
char backup[N][N];
int h[N][N], u[N][N];
int n, m;

void f(int x, int y){
    for (int i = 0; i < 5; i ++ )
    {
        int a = x + dx[i], b = y + dy[i];

        if (a < 0 || a >= n || b < 0 || b >= m) continue;

        g[a][b] ^= 1;   
    }
}
int main()
{
    cin >> n >> m;
    for (int i = 0; i < n; i ++ ) {
        for (int j = 0; j < m; j ++ ){
              cin >> g[i][j];
        }
    }

    int res = 226;
    for(int op = 0; op < (1 << m); op ++) {
        memcpy(backup, g, sizeof g);
        memset(h, 0, sizeof h);
        int step = 0;
        for(int i = 0; i < m; i ++) {
            if(op >> i & 1) {
                f(0, i);
                h[0][i] ++;
                step ++;
            }
        }
        for(int i = 0; i < n - 1; i ++){
            for(int j = 0; j < m; j ++){
                if(g[i][j] == '1'){
                    f(i + 1, j);
                    h[i + 1][j]++;
                    step ++;
                }
            }
        }
        bool bork = false;
        for(int i = 0; i < m; i ++) {
            if(g[n-1][i] == '1'){
                bork = true;
                break;
            }
        }
        if(!bork) {
            if(res > step){
                memcpy(u, h, sizeof h);
            }
            res = min(res, step);
        }
        memcpy(g, backup, sizeof g);
    }
    if(res >= 226) cout << "IMPOSSIBLE" << endl;
    else{
        for (int i = 0; i < n; i ++ )
        {
            for (int j = 0; j < m; j ++ ){
                cout << u[i][j] << ' ';
            }
            cout << endl;
        }
    }

    return 0;
}