Problem: Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed!

Vasya knows that the matrix consists of n rows and m columns. For each row, he knows the xor (bitwise excluding or) of the elements in this row. The sequence a1, a2, ..., an denotes the xor of elements in rows with indices 1, 2, ..., n, respectively. Similarly, for each column, he knows the xor of the elements in this column. The sequence b1, b2, ..., bm denotes the xor of elements in columns with indices 1, 2, ..., m, respectively.

Help Vasya! Find a matrix satisfying the given constraints or tell him that there is no suitable matrix.

Input

The first line contains two numbers n and m (2 ≤ n, m ≤ 100) — the dimensions of the matrix.

The second line contains n numbers a1, a2, ..., an (0 ≤ ai ≤ 109), where ai is the xor of all elements in row i.

The third line contains m numbers b1, b2, ..., bm (0 ≤ bi ≤ 109), where bi is the xor of all elements in column i.

Output

If there is no matrix satisfying the given constraints in the first line, output "NO".

Otherwise, on the first line output "YES", and then n rows of m numbers in each ci1, ci2, ... , cim (0 ≤ cij ≤ 2·109) — the description of the matrix.

If there are several suitable matrices, it is allowed to print any of them.

Examples

Input

2 3
2 9
5 3 13


Output

YES
3 4 5
6 7 8


Input

3 3
1 7 6
2 15 12


Output

NO

Solution (in PYTHON3):

Solution:
#!/usr/bin/env python
import os
import sys

from io import BytesIO, IOBase

# Bootstrap https://github.com/cheran-senthil/PyRival/blob/master/tests/misc/test_bootstrap.py
from types import GeneratorType


def bootstrap(f, stack=[]):
    def wrappedfunc(*args, **kwargs):
        if stack:
            return f(*args, **kwargs)
        else:
            to = f(*args, **kwargs)
            while True:
                if type(to) is GeneratorType:
                    stack.append(to)
                    to = next(to)
                else:
                    stack.pop()
                    if not stack:
                        break
                    to = stack[-1].send(to)
            return to

    return wrappedfunc


#################

from collections import defaultdict

INF = pow(2, 63)


def solve(n, m, arrn, arrm):
    def bitat(num, shift):
        return (num >> shift) & 1

    def set_bit(value, bit):
        return value | (1 << bit)

    mask = pow(2, 63) - 1

    def unset_bit(value, bit):
        return value & (mask ^ (1 << bit))

    def update_bit(value, bit, bitval):
        if bitval:
            return set_bit(value, bit)
        return unset_bit(value, bit)

    ans = [[0] * m for _ in range(n)]

    for b in range(32):
        unsat_cnt = 0
        for i in [0]:
            bit = 0
            for j in range(m):
                bit = bit ^ bitat(arrm[j], b)
                if bitat(arrm[j], b):
                    ans[i][j] = set_bit(ans[i][j], b)
            if bit != bitat(arrn[i], b):
                unsat_cnt += 1
                bitt = bitat(ans[i][-1], b) ^ 1
                ans[i][-1] = update_bit(ans[i][-1], b, bitt)
            for k in range(1, n):
                if bitat(arrn[k], b):
                    unsat_cnt += 1
                    ans[k][-1] = set_bit(ans[k][-1], b)
        if unsat_cnt % 2 != 0:
            return False
    return ans


@bootstrap
def rec(i, k, arr, mp, f=0):
    # return str((arr[n - 1] - arr[0]) * (arr[-1] - arr[n]))
    pass


def main():
    # n, k = map(int, input().strip().split())
    # a = []
    # for _ in range(n):
    #     a.append(input().strip())
    # print(solve(n, k, a))
    # for _ in range(int(input().strip())):
    # n = int(input().strip())
    [n, m] = list(map(int, input().strip().split()))
    arrn = list(map(int, input().strip().split()))
    arrm = list(map(int, input().strip().split()))

    ans = solve(n, m, arrn, arrm)
    if not ans:
        print('NO')
        return
    print('YES')
    for i in range(n):
        ans[i] = [str(x) for x in ans[i]]
        print(' '.join(ans[i]))


######## Python 2 and 3 footer by Pajenegod and c1729

# Note because cf runs old PyPy3 version which doesn't have the sped up
# unicode strings, PyPy3 strings will many times be slower than pypy2.
# There is a way to get around this by using binary strings in PyPy3
# but its syntax is different which makes it kind of a mess to use.

# So on cf, use PyPy2 for best string performance.

py2 = round(0.5)
if py2:
    from future_builtins import ascii, filter, hex, map, oct, zip

    range = xrange

import os, sys
from io import IOBase, BytesIO

BUFSIZE = 8192


class FastIO(BytesIO):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.writable = "x" in file.mode or "w" in file.mode
        self.write = super(FastIO, self).write if self.writable else None

    def _fill(self):
        s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
        self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
        return s

    def read(self):
        while self._fill(): pass
        return super(FastIO, self).read()

    def readline(self):
        while self.newlines == 0:
            s = self._fill();
            self.newlines = s.count(b"\n") + (not s)
        self.newlines -= 1
        return super(FastIO, self).readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.getvalue())
            self.truncate(0), self.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        if py2:
            self.write = self.buffer.write
            self.read = self.buffer.read
            self.readline = self.buffer.readline
        else:
            self.write = lambda s: self.buffer.write(s.encode('ascii'))
            self.read = lambda: self.buffer.read().decode('ascii')
            self.readline = lambda: self.buffer.readline().decode('ascii')


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline()

# Cout implemented in Python
import sys


class ostream:
    def __lshift__(self, a):
        sys.stdout.write(str(a))
        return self


cout = ostream()
endl = '\n'


# Read all remaining integers in stdin, type is given by optional argument, this is fast
def readnumbers(zero=0):
    conv = ord if py2 else lambda x: x
    A = [];
    numb = zero;
    sign = 1;
    i = 0;
    s = sys.stdin.buffer.read()
    try:
        while True:
            if s[i] >= b'0'[0]:
                numb = 10 * numb + conv(s[i]) - 48
            elif s[i] == b'-'[0]:
                sign = -1
            elif s[i] != b'\r'[0]:
                A.append(sign * numb)
                numb = zero;
                sign = 1
            i += 1
    except:
        pass
    if s and s[-1] >= b'0'[0]:
        A.append(sign * numb)
    return A


if __name__ == "__main__":
    #for _ in range(2):  # todo for testing else remove for loop
        main()