type F = i32;
pub const INF: F = 4_000_000;
const ZERO: F = 0;
fn non_zero(f: F) -> bool {
    f > ZERO
}
fn min(a: F, b: F) -> F {
    if a < b {
        a
    } else {
        b
    }
}
pub struct Graph {
    n: usize,
    depth: Vec<usize>,
    it: Vec<usize>,
    g: Vec<Vec<(usize, F, usize)>>,
}

impl Graph {
    pub fn new(n: usize) -> Graph {
        Graph {
            n: n,
            depth: vec![n + 1; n],
            it: vec![0; n],
            g: vec![vec![]; n],
        }
    }
    pub fn add_edge(&mut self, s: usize, t: usize, f: F) -> usize {
        let x = self.g[s].len();
        let y = self.g[t].len();
        let k = self.g[s].len();
        self.g[s].push((t, f, y));
        self.g[t].push((s, ZERO, x));
        k
    }
    fn bfs(&mut self, src: usize, dst: usize) {
        let g = &self.g;
        let n = self.n;
        let dp = &mut self.depth;
        dp.clear();
        dp.resize(n, n + 1);
        dp[src] = 0;
        let mut q = std::collections::VecDeque::new();
        q.push_back(src);
        'outer: while let Some(v) = q.pop_front() {
            for &(u, f, _) in g[v].iter() {
                if dp[u] > dp[v] + 1 && non_zero(f) {
                    dp[u] = dp[v] + 1;
                    if u == dst {
                        break 'outer;
                    }
                    q.push_back(u);
                }
            }
        }
    }
    fn dfs(&mut self, v: usize, src: usize, f: F) -> F {
        if v == src {
            return f;
        }
        while self.it[v] < self.g[v].len() {
            let (u, _, inv) = self.g[v][self.it[v]];
            if self.depth[u] < self.depth[v] && non_zero(self.g[u][inv].1) {
                let capa = min(f, self.g[u][inv].1);
                let c = self.dfs(u, src, capa);
                if non_zero(c) {
                    self.g[v][self.it[v]].1 += c;
                    self.g[u][inv].1 -= c;
                    return c;
                }
            }
            self.it[v] += 1;
        }
        ZERO
    }
    pub fn flow(&mut self, src: usize, dst: usize) -> F {
        let mut ans = ZERO;
        loop {
            self.bfs(src, dst);
            if self.depth[dst] > self.n {
                break;
            }
            self.it.clear();
            self.it.resize(self.n, 0);
            loop {
                let f = self.dfs(dst, src, INF);
                if non_zero(f) {
                    ans += f;
                } else {
                    break;
                }
            }
        }
        ans
    }
}

//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

//

fn run() {
    input! {
        h: usize,
        w: usize,
        a: [i32; h],
        b: [i32; w],
        k: usize,
        p: [(usize1, usize1); k],
    }
    let mut p = p;
    p.sort();
    let mut solver = Graph::new(h + w + 2);
    let src = h + w + 1;
    let dst = h + w;
    for (i, a) in a.iter().enumerate() {
        solver.add_edge(src, i, *a);
    }
    for (j, b) in b.iter().enumerate() {
        solver.add_edge(j + h, dst, *b);
    }
    let mut index = vec![vec![None; w]; h];
    for i in 0..h {
        for j in 0..w {
            if p.binary_search(&(i, j)).is_err() {
                let k = solver.add_edge(i, j + h, 1);
                index[i][j] = Some(k);
            }
        }
    }
    if solver.flow(src, dst) < a.iter().sum::<i32>() {
        println!(":(");
        return;
    }
    println!("Yay!");
    for i in 0..h {
        let mut s = String::new();
        for j in 0..w {
            if p.binary_search(&(i, j)).is_ok() {
                s.push('x');
                continue;
            }
            let k = index[i][j].unwrap();
            if solver.g[i][k].1 == 0 {
                s.push('o');
            } else {
                s.push('.');
            }
        }
        println!("{}", s);
    }
}

fn main() {
    run();
}