#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


namespace MF {
	const int LIM_N = 10010;
	const int LIM_M = 5000010;
	typedef int wint;
	const wint wEPS = 0;
	const wint wINF = 1001001001;
	int n, m, ptr[LIM_N], nxt[LIM_M * 2], zu[LIM_M * 2];
	wint capa[LIM_M * 2], tof;
	int lev[LIM_N], see[LIM_N], que[LIM_N], *qb, *qe;
	void init(int _n) {
		n = _n; m = 0; fill(ptr, ptr + n, -1);
	}
	void ae(int u, int v, wint w0, wint w1 = 0) {
		nxt[m] = ptr[u]; ptr[u] = m; zu[m] = v; capa[m] = w0; ++m;
		nxt[m] = ptr[v]; ptr[v] = m; zu[m] = u; capa[m] = w1; ++m;
	}
	wint augment(int src, int ink, wint flo) {
		if (src == ink) return flo;
		for (int &i = see[src]; ~i; i = nxt[i]) if (capa[i] > wEPS && lev[src] < lev[zu[i]]) {
			const wint f = augment(zu[i], ink, min(flo, capa[i]));
			if (f > wEPS) {
				capa[i] -= f; capa[i ^ 1] += f; return f;
			}
		}
		return 0;
	}
	bool solve(int src, int ink, wint flo = wINF) {
		for (tof = 0; tof + wEPS < flo; ) {
			qb = qe = que; fill(lev, lev + n, -1);
			for (lev[*qe++ = src] = 0, see[src] = ptr[src]; qb != qe; ) {
				const int u = *qb++;
				for (int i = ptr[u]; ~i; i = nxt[i]) if (capa[i] > wEPS) {
					const int v = zu[i];
					if (lev[v] == -1) {
						lev[*qe++ = v] = lev[u] + 1; see[v] = ptr[v];
						if (v == ink) goto au;
					}
				}
			}
			return false;
		au:	for (wint f; (f = augment(src, ink, flo - tof)) > wEPS; tof += f);
		}
		return true;
	}
}


int H, W;
vector<int> A, B;
int K;
vector<int> X, Y;

int main() {
  for (; ~scanf("%d%d", &H, &W); ) {
    A.resize(H);
    for (int x = 0; x < H; ++x) {
      scanf("%d", &A[x]);
    }
    B.resize(W);
    for (int y = 0; y < W; ++y) {
      scanf("%d", &B[y]);
    }
    scanf("%d", &K);
    X.resize(K);
    Y.resize(K);
    for (int k = 0; k < K; ++k) {
      scanf("%d%d", &X[k], &Y[k]);
      --X[k];
      --Y[k];
    }
    
    vector<vector<int>> ids(H, vector<int>(W, -1));
    for (int k = 0; k < K; ++k) {
      ids[X[k]][Y[k]] = -2;
    }
    MF::init(2 + H + W);
    int ASum = 0, BSum = 0;
    for (int x = 0; x < H; ++x) {
      ASum += A[x];
      MF::ae(0, 2 + x, A[x]);
    }
    for (int y = 0; y < W; ++y) {
      BSum += B[y];
      MF::ae(2 + H + y, 1, B[y]);
    }
    for (int x = 0; x < H; ++x) for (int y = 0; y < W; ++y) {
      if (ids[x][y] == -1) {
        ids[x][y] = MF::m;
        MF::ae(2 + x, 2 + H + y, 1);
      }
    }
    const bool res = MF::solve(0, 1, max(ASum, BSum));
    if (res) {
      puts("Yay!");
      for (int x = 0; x < H; ++x) {
        for (int y = 0; y < W; ++y) {
          putchar((ids[x][y] == -2) ? 'x' : MF::capa[ids[x][y]] ? '.' : 'o');
        }
        puts("");
      }
    } else {
      puts(":(");
    }
  }
  return 0;
}