ソースコード
// 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
char board[10][10];
int C; string T;
string col = "bw";
signed main() {
rep(i,0,8) rep(j,0,8) cin >> board[i][j];
cin >> C >> T;
int x = T[1] - '1', y = T[0] - 'A';
char c = col[C];
board[x][y] = c;
// printf("x = %lld, y = %lld\n", x, y);
rep(k,0,8) {
int nx = x, ny = y;
int cnt = 0;
while(1) {
cnt++;
nx += dx[k], ny += dy[k];
if(nx < 0 || nx >= 8 || ny < 0 || ny >= 8 || board[nx][ny] == '-') {
cnt = 0;
break;
}
if(board[nx][ny] == c) break;
}
// printf("dir = %lld, cnt = %lld\n", k, cnt);
repq(i,0,cnt) board[x + i*dx[k]][y + i*dy[k]] = c;
}
rep(i,0,8) {
rep(j,0,8) printf("%c", board[i][j]);
cout << endl;
}
return 0;
}