#include <bits/stdc++.h>
using namespace std;
const int N = 102, MOD = 1e9 + 7;
const double EPS = 1e-14;
void rofl() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
int n, m;
int a[N], b[N], ans[N][N];
void read() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }
}
void get_bit(int k) {
  int sum1 = 0, sum2 = 0;
  for (int i = 0; i < n; i++) {
    sum1 += (a[i] >> k & 1);
  }
  for (int j = 0; j < m; j++) {
    sum2 += (b[j] >> k & 1);
  }
  if ((sum1 & 1) != (sum2 & 1)) {
    cout << "NO";
    exit(0);
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if ((a[i] >> k & 1) == (b[j] >> k & 1)) {
        if ((a[i] >> k & 1) == 1) {
          a[i] -= (1 << k);
          b[j] -= (1 << k);
          ans[i][j] += (1 << k);
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (a[i] >> k & 1) {
      assert(0 == (ans[i][0] >> k & 1));
      ans[i][0] += (1 << k);
    }
  }
  for (int i = 0; i < m; i++) {
    if (b[i] >> k & 1) {
      assert(0 == (ans[0][i] >> k & 1));
      ans[0][i] += (1 << k);
    }
  }
}
signed main() {
  rofl();
  read();
  for (int i = 0; i <= 30; i++) {
    get_bit(i);
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << ans[i][j] << " ";
    }
    cout << "\n";
  }
}
