#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<char>> rot(vector<vector<char>> S) {
    vector<vector<char>> G(S[0].size(), vector<char>(S.size()));

    for (ll i = 0; i < S.size(); ++i) {
        for (ll j = 0; j < S[0].size(); ++j) {
            G[j][S.size() - 1 - i] = S[i][j];
        }
    }

    return G;
}

template <typename STRING = string>
vector<pair<typename STRING::value_type, ll>> run_length(STRING& S) {
  vector<pair<typename STRING::value_type, ll>> res;
  for (auto&& x: S) {
    if (res.empty() || res.back().first != x) { res.emplace_back(x, 0); }
    res.back().second++;
  }
  return res;
}


void solve() {
    ll n,w,h;
    cin >> n >> w >> h;
    string S;
    cin >> S;
    ll mx = 0;
    // for (ll i = 0; i < n; ++i)

    vector<pair<char, ll>> ln = run_length(S);

    vector<vector<char>> ans(w, vector<char>(h,'x'));
    for (ll i = 0; i < ln.size(); ++i) {
        if (ln[i].first != 'o') continue;
        //  if (i >= S.size()) return;
        // if (S[i] == 'l') ++i;
        // if (i >= S.size()) return;

        for (ll j = 0; j < ln[i].second; ++j) {
            ans[i/2][j]='o';
        }
    }

    vector<vector<char>> anss = rot(ans);
    vector<vector<char>> ansss = rot(anss);
    for (ll i = 0; i < ans[0].size(); ++i) {
        for (ll j = 0; j < ans.size(); ++j) {
            cout << ans[j][ans[0].size()-1-i];
        }
        cout << endl;
    }

    // vector<vector<ll>> anss = rot(ans);
    // for 
    

}

int main() {
    solve();
    return 0;
}