use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        n: usize,
        s: [bytes; n],
        row: [i32; n],
        col: [i32; n],
    }
    let mut row = row;
    let mut col = col;
    let mut ans = vec![vec![b'0'; n]; n];
    for (i, (row, s)) in row.iter_mut().zip(s.iter()).enumerate() {
        for (j, (col, s)) in col.iter_mut().zip(s.iter()).enumerate() {
            if *s == b'-' {
                *row += 1;
                *col += 1;
                ans[i][j] = b'1';
            }
        }
    }
    if row.iter().chain(col.iter()).any(|p| *p < 0 || (n as i32) < *p) {
        println!("No");
        return;
    }
    if row.iter().sum::<i32>() != col.iter().sum::<i32>() {
        println!("No");
        return;
    }
    let mut x = (0..n).collect::<Vec<_>>();
    let mut y = (0..n).collect::<Vec<_>>();
    x.sort_by_key(|x| row[*x]);
    for &x in x.iter().rev() {
        y.sort_by_key(|x| col[*x]);
        for &y in y.iter().rev().take(row[x] as usize) {
            if col[y] == 0 {
                println!("No");
                return;
            }
            col[y] -= 1;
            ans[x][y] ^= b'0' ^ b'1';
        }
    }
    use util::*;
    println!("Yes");
    for a in ans {
        println!("{}", a.iter().map(|c| *c as char).join(""));
    }
}

fn main() {
    run();
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
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_export]
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_export]
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")
    };
}
// ---------- end input macro ----------
mod util {
    pub trait Join {
        fn join(self, sep: &str) -> String;
    }

    impl<T, I> Join for I
    where
        I: Iterator<Item = T>,
        T: std::fmt::Display,
    {
        fn join(self, sep: &str) -> String {
            let mut s = String::new();
            use std::fmt::*;
            for (i, v) in self.enumerate() {
                if i > 0 {
                    write!(&mut s, "{}", sep).ok();
                }
                write!(&mut s, "{}", v).ok();
            }
            s
        }
    }
}