#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <atcoder/modint>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
using namespace atcoder;
using mint = modint998244353;

int n, w, h;
string s;
bool used[100][100];

signed main() {
	int i, j;

	cin >> n >> w >> h >> s;
	
	vector<int> hs;
	int x = 0;
	rep(i, n) {
		if (s[i] == 'o') { x++; }
		else { hs.push_back(x); x = 0; }
	}
	hs.push_back(x);

	rep(i, hs.size()) {
		rep(j, hs[i]) {
			used[h - 1 - j][i] = true;
		}
	}

	rep(i, h) {
		rep(j, w) {
			if (used[i][j]) cout << "o";
			else cout << "x";
		}
		cout << endl;
	}
	return 0;
}