#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9 + 7;
const int modulo = 1e9 + 7;
template <typename T>
inline T sum(const T& a, const T& b) {
  return T((a % modulo + b % modulo) % modulo);
}
template <typename T>
inline T mul(const T& a, const T& b) {
  return T((1LL * (a % (1LL * modulo)) * (b % (1LL * modulo))) %
           (1LL * modulo));
}
string to_string(string a) { return "\"" + a + "\""; }
const int N = 1e2 + 5;
int a[N], b[N], f[N][N];
int n, m;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  int r = 0;
  for (int i = 1; i <= n; ++i) cin >> a[i], r ^= a[i];
  for (int i = 1; i <= m; ++i) cin >> b[i], r ^= b[i];
  if (r) {
    cout << "NO";
    return 0;
  }
  printf("YES\n");
  memset(f, 0, sizeof f);
  int z = 0;
  for (int i = 1; i <= n - 1; ++i) {
    f[i][m] = a[i];
    z ^= a[i];
  }
  for (int i = 1; i <= m - 1; ++i) f[n][i] = b[i];
  f[n][m] = b[m] ^ z;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) printf("%d%c", f[i][j], " \n"[j == m]);
  return 0;
}
