#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

const int INF = 1e9;
const ll LLINF = 4e18;
const double EPS = 1e-9;

void solve() {
    ll r,k;
    cin >> r >> k;
    string s;
    cin >> s;
    s = "." + s + ".";
    for (ll i=0; i<k; ++i) {
        string s1 = s;
        for (ll j=1; j<s.size()-1;++j) {
            ll val = ((s[j-1] == 'X') ? 4 : 0)
                       + ((s[j] == 'X') ? 2 : 0)
                       + ((s[j+1] == 'X') ? 1 : 0);
            s1[j] = (r >> val) & 1 ? 'X' : '.';
        }
        s = std::move(s1);
        for (ll i=1; i<s.size()-1; ++i) {
            cout << s[i];
        }
        cout << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}