#include //#include using namespace std; // using namespace atcoder; // using mint = modint1000000007; // const int mod = 1000000007; // using mint = modint998244353; // const int mod = 998244353; // const int INF = 1e9; // const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i, l, r) for (int i = (l); i < (r); ++i) #define rrep(i, n) for (int i = (n)-1; i >= 0; --i) #define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define P pair template inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; } vector

key_list(std::vectors) { int h = s.size(); int w = s[0].size(); auto keyData = [&](int i, int j)->P { int x = -1, y = -1; if (s[i][j] == '#')return { x,y }; // 横 if (j != w - 1 && s[i][j + 1] != '#' && (j == 0 || s[i][j - 1] == '#')) { x = 0; rep2(nj, j, w) { if (s[i][nj] == '#')break; x++; } } // 縦 if (i != h - 1 && s[i + 1][j] != '#' && (i == 0 || s[i - 1][j] == '#')) { y = 0; rep2(ni, i, h) { if (s[ni][j] == '#')break; y++; } } return { x,y }; }; vector

ret; rep(i, h)rep(j, w) { auto key = keyData(i, j); if (key.first + key.second == -2)continue; ret.emplace_back(i, j); } return ret; } bool write(vector& board, int x, int y, int t, string a) { int sz = a.size(); if (t == 0) { rep(j, sz) { if (board[x][y + j] != '.' && board[x][y + j] != a[j])return false; board[x][y + j] = a[j]; } } else { rep(i, sz) { if (board[x + i][y] != '.' && board[x + i][y] != a[i])return false; board[x + i][y] = a[i]; } } return true; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int h, w; cin >> h >> w; vectors(h); rep(i, h)cin >> s[i]; auto keys = key_list(s); int q; cin >> q; while (q--) { int k, d; cin >> k >> d; string a; cin >> a; k--; write(s, keys[k].first, keys[k].second, d, a); rep(i, h)cout << s[i] << endl; } return 0; }