#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC oprimize("unrol-loops")

#define vec vector
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define int long long

using namespace std;

typedef pair<int, int> pii;

const int inf = 2e18;
int mod = 100000007;


void solve(){
    int n, m;
    cin>>n>>m;
    map<string, int> p;
    vec<int> bits;
    for(int i = 0;i<8;i++){
        bits.push_back((1<<i) & n);
    }

    reverse(all(bits));

    p["111"] = bits[0];
    p["110"] = bits[1];
    p["101"] = bits[2];
    p["100"] = bits[3];
    p["011"] = bits[4];
    p["010"] = bits[5];
    p["001"] = bits[6];
    p["000"] = bits[7];

    string s;
    cin>>s;

    for(int i = 0;i<s.size();i++){
        if(s[i] == 'X')
            s[i] = '1';
        else
            s[i] = '0';
    }

    for(int i = 0;i<m;i++){

        string st = "0" + s  + "0";
        string ans = "";
        for(int i = 0;i<st.size()-2;i++){
            string key = "";
            key += st[i];
            key += st[i+1];
            key += st[i+2];
            if(p[key]){
                cout << 'X';
                ans += '1';
            }
            else{
                cout << '.';
                ans += '0';
            }
        }
        cout << "\n";
        s = ans;

    }

}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tests = 1;
    while(tests--){
        solve();
    }
}