#include using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep2(i, x, n) for (int i = x; i <= n; i++) #define rep3(i, x, n) for (int i = x; i >= n; i--) #define each(e, v) for (auto &e : v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; template bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template int flg(T x, int i) { return (x >> i) & 1; } template void print(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template void printn(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template int lb(const vector &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template int ub(const vector &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template void rearrange(vector &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template vector id_sort(const vector &v, bool greater = false) { int n = v.size(); vector ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template pair operator+(const pair &p, const pair &q) { return make_pair(p.first + q.first, p.second + q.second); } template pair operator-(const pair &p, const pair &q) { return make_pair(p.first - q.first, p.second - q.second); } template istream &operator>>(istream &is, pair &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template ostream &operator<<(ostream &os, const pair &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; const int MOD = 1000000007; // const int MOD = 998244353; int main() { int H, W; cin >> H >> W; vector a(H), b(W); rep(i, H) cin >> a[i]; rep(j, W) cin >> b[j]; if (accumulate(all(a), 0) != accumulate(all(b), 0)) { cout << ":(\n"; return 0; } vector> c(H, vector(W, 0)); vector cnt(H + 1, 0); vector s(H + 1, 0); rep(j, W) cnt[b[j]]++; rep(i, H) { if (a[i] == 0) continue; s[0] = cnt[0]; rep2(j, 1, H) s[j] = s[j - 1] + cnt[j]; int t = ub(s, W - a[i]); if (t == 0) { cout << ":(\n"; return 0; } int T = a[i] - (W - s[t]); rep(j, W) { if (b[j] > t) { c[i][j] = 1; cnt[b[j]]--; cnt[--b[j]]++; } else if (b[j] == t && T > 0) { c[i][j] = 1; T--; cnt[b[j]]--; cnt[--b[j]]++; } } } int K; cin >> K; while (K--) { int x, y; cin >> x >> y; x--, y--; if (c[x][y] == 0) { c[x][y] = -1; continue; } queue que; vector pre1(H, -1), pre2(W, -1); pre1[x] = y; que.emplace(1, x); while (!empty(que)) { auto [t, id] = que.front(); que.pop(); if (t == 2 && id == y) break; if (t == 1) { int i = id; rep(j, W) { if (c[i][j] == 0 && pre2[j] == -1) { pre2[j] = i; que.emplace(2, j); } } } else { int j = id; rep(i, H) { if (c[i][j] == 1 && pre1[i] == -1) { pre1[i] = j; que.emplace(1, i); } } } } if (pre2[y] == -1) { cout << ":(\n"; return 0; } int j = y; while (true) { int i = pre2[j], nj = pre1[i]; c[i][j] = 1; c[i][nj] = 0; j = nj; if (j == y) break; } c[x][y] = -1; } cout << "Yay!\n"; rep(i, H) { rep(j, W) { if (c[i][j] == 1) { cout << "o"; } else if (c[i][j] == 0) { cout << "."; } else { cout << "x"; } } cout << '\n'; } }