#include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 typedef long long ll;

 using namespace std;

 #define N   110

 #define oo  10000000

 #define MOD 1000000007

 int a[N],b[N]; 

 int main()

 {

     int n,m;

     scanf("%d%d",&n,&m);

     int s1=,s2=;

     for(int i=;i<=n;i++)

     {

         scanf("%d",&a[i]);

         s1^=a[i];

     }

     for(int i=;i<=m;i++)

     {

         scanf("%d",&b[i]);

         s2^=b[i];

     }

     if(s1!=s2)

     {

         printf("NO\n");

         return ;

     }

     printf("YES\n");

     for(int i=;i<=n;i++)

     {

          for(int j=;j<=m;j++)

          {

              if(i==&&j==){printf("%d ",s1^a[]^b[]); continue;}

              if(i==){printf("%d ",b[j]); continue;}

              if(j==){printf("%d ",a[i]); continue;}

              printf("0 ");

          }

          printf("\n");

     }

     return ;

 }