//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;



#include <unistd.h>

struct Scanner {
    int fd = -1;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += ::read(fd, line + ed, (1 << 15) - ed);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) {
            bool sep = false;
            for (size_t i = st; i < ed; i++) {
                if (isspace(line[i])) {
                    sep = true;
                    break;
                }
            }
            if (!sep) reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] & 0xf);
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    int read_unsafe() { return 0; }
    template <class H, class... T> int read_unsafe(H& h, T&... t) {
        bool f = read_single(h);
        if (!f) return 0;
        return 1 + read_unsafe(t...);
    }
    Scanner(FILE* fp) : fd(fileno(fp)) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(__int128 val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }

    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

VV<int> base(V<int> a, V<int> b) {
    int h = int(a.size());
    int w = int(b.size());
    V<int> idx(h);
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int x, int y) {
        return a[x] > a[y];
    });

    VV<int> answer(h, V<int>(w));

    using P = pair<int, int>;
    priority_queue<P> que;
    for (int i = 0; i < w; i++) {
        que.push({b[i], i});
    }
    for (int r: idx) {
        for (int i = 0; i < a[r]; i++) {
            if (que.empty()) return {};
            auto p = que.top(); que.pop();
            answer[r][p.second] = 1;
            if (p.first >= 2) que.push({p.first - 1, p.second});
        }
    }
    if (que.size()) return {};
    return answer;
}

int main() {
    int h, w;
    sc.read(h, w);
    V<int> a(h), b(w);
    for (int i = 0; i < h; i++) {
        sc.read(a[i]);
    }
    for (int i = 0; i < w; i++) {
        sc.read(b[i]);
    }
    auto g = V<string>(h, string(w, '.'));
    auto answer = base(a, b);
    if (answer.empty()) {
        pr.writeln(":(");
        return 0;
    }


    int k;
    sc.read(k);
    for (int i = 0; i < k; i++) {
        int r, c;
        sc.read(r, c); r--; c--;
        g[r][c] = 'x';
        if (!answer[r][c]) continue;

        V<int> vis(h + w);
        auto dfs = [&](auto self, int p) -> bool {
            if (p == w + c) return true;
            if (vis[p]) return false;
            vis[p] = true;
            if (p < h) {
                for (int q = 0; q < w; q++) {
                    if (answer[p][q] || g[p][q] == 'x') continue;
                    if (self(self, h + q)) {
                        answer[p][q] = true;
                        return true;
                    }
                }
            } else {
                for (int q = 0; q < h; q++) {
                    if (!answer[q][p - w] || g[q][p - w] == 'x') continue;
                    if (self(self, q)) {
                        answer[q][p - w] = false;
                        return true;
                    }
                }
            }
            return false;
        };
        if (!dfs(dfs, r)) {
            pr.writeln(":(");
            return 0;
        }
        answer[r][c] = false;
    }

    for (int r = 0; r < h; r++) {
        for (int c = 0; c < w; c++) {
            if (answer[r][c]) {
                assert(g[r][c] == '.');
                g[r][c] = 'o';
            }
        }
    }

    for (auto s: g) {
        pr.writeln(s);
    }

    return 0;
}