#include "bits/stdc++.h" #define REP(i,n) for(ll i=0;i=0;--i) #define FOR(i,m,n) for(ll i=m;i=ll(m);--i) #define ALL(v) (v).begin(),(v).end() #define UNIQUE(v) v.erase(unique(ALL(v)),v.end()); #define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; } #define INF 1000000001ll #define MOD 1000000007ll #define EPS 1e-9 const int dx[8] = { 1,1,0,-1,-1,-1,0,1 }; const int dy[8] = { 0,1,1,1,0,-1,-1,-1 }; using namespace std; typedef long long ll; typedef vector vi; typedef vector vl; typedef vector vvi; typedef vector vvl; typedef pair pii; typedef pair pll; ll max(ll a, int b) { return max(a, ll(b)); } ll max(int a, ll b) { return max(ll(a), b); } ll min(ll a, int b) { return min(a, ll(b)); } ll min(int a, ll b) { return min(ll(a), b); } ///(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)/// int main() { cin.tie(0); ios::sync_with_stdio(false); int w, h; char c; cin >> w >> h >> c; if (c == 'B') { REP(i, h) { REP(j, w) { if ((i + j) % 2) { cout << 'W'; } else cout << 'B'; } cout << endl; } } else { REP(i, h) { REP(j, w) { if ((i + j) % 2==0) { cout << 'W'; } else cout << 'B'; } cout << endl; } } }