#include <iostream>
#include <bitset>

using namespace std;
int a[210][210],b[210][210];
bitset<40000> bs[210];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int i,j,k,n,m;
    cin >> n >> m;
    if(n<=3){
        for(i=0;i<m - 1;i++){
            for(j=i + 1;j<m;j++){
                cout << 1;
            }
            cout << "\n";
        }
    }
    for(k=0;k<m;k++){
        for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                char c; cin >> c;
                if(c=='#') a[i][j] = 1;
                else a[i][j] = 0;
            }
        }
        for(i=0;i<n - 1;i++){
            for(j=0;j<n - 1;j++){
                int num = (a[i][j] + a[i + 1][j] + a[i][j + 1] + a[i + 1][j + 1])%2;
                b[i][j] = num;
            }
        }
        for(i=1;i<n - 2;i++){
            for(j=1;j<n - 2;j++){
                int num = (b[i - 1][j] + b[i + 1][j] + b[i][j + 1] + b[i][j - 1])%2;
                if(num==0) bs[k][i*n + j] = 0;
                else bs[k][i*n + j] = 1;
            }
        }
    }
    for(i=0;i<m - 1;i++){
        for(j=i + 1;j<m;j++){
            bitset<40000> bss = bs[i]^bs[j];
            if(bss.none()) cout << 1;
            else cout << 0;
        }
        cout << "\n";
    }
}