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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
const int Bases = 2;
const long long base[] = {137, 37};
const long long mod = 1000000007LL;
long long addi(long long a, long long b, long long m = mod) {
  a += b;
  if (a < 0) a += m;
  if (a >= m) a -= m;
  return a;
}
long long subt(long long a, long long b, long long m = mod) {
  a -= b;
  if (a < 0) a += m;
  if (a >= m) a -= m;
  return a;
}
long long mult(long long a, long long b, long long m = mod) {
  return a * b % m;
}
long long power(long long a, long long b, long long m = mod) {
  long long tmp = 1;
  for (; b > 0; b >>= 1) {
    if (b & 1LL) tmp = mult(tmp, a, m);
    a = mult(a, a, m);
  }
  return tmp;
}
long long inv(long long a, long long m = mod) { return power(a, m - 2, m); }
int n, m, a[105], b[105];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> m >> n;
  for (int i = 1; i <= m; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) cin >> b[i];
  int sum = 0;
  for (int i = 1; i <= m; ++i) sum ^= a[i];
  for (int i = 1; i <= n; ++i) sum ^= b[i];
  if (sum) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n";
  for (int i = 2; i <= n; ++i) sum ^= b[i];
  cout << (sum ^ a[1]) << ' ';
  for (int i = 2; i <= n; ++i) cout << b[i] << ' ';
  cout << '\n';
  for (int i = 2; i <= m; ++i) {
    cout << a[i] << ' ';
    for (int j = 2; j <= n; ++j) cout << "0 ";
    cout << '\n';
  }
  return 0;
}