#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m;
  cin >> n >> m;
  vector<long long> a(n), b(m);
  vector<vector<long long> > ret(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    ret[i].resize(m);
    for (int j = 0; j < m; ++j) {
      ret[i][j] = 0;
    }
  }
  for (int i = 0; i < m; ++i) {
    cin >> b[i];
  }
  for (int i = 0; i < 40; ++i) {
    int curr = 1 << i;
    vector<int> aa, bb;
    for (int j = 0; j < n; ++j) {
      if ((a[j] & curr) >> i == 1) aa.push_back(j);
    }
    for (int j = 0; j < m; ++j) {
      if ((b[j] & curr) >> i == 1) bb.push_back(j);
    }
    int j;
    for (j = 0; j < (int)min(aa.size(), bb.size()); ++j) {
      ret[aa[j]][bb[j]] += curr;
    }
    if (aa.size() == bb.size()) continue;
    if ((max(aa.size(), bb.size()) - min(aa.size(), bb.size())) % 2 != 0) {
      cout << "NO" << endl;
      return 0;
    }
    if (aa.size() < bb.size()) {
      for (; j < bb.size(); ++j) {
        ret[0][bb[j]] += curr;
      }
    } else {
      for (; j < aa.size(); ++j) {
        ret[aa[j]][0] += curr;
      }
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      cout << ret[i][j] << " ";
    }
    cout << endl;
  }
}
