#include<cstdio>
int a[22],n,m;
int d[22];
int t[22];
int r[22];
int chk[22];
int eff[22][22];
int w[444];
int x[444];
int y[444];
int z[444];
void dfs(int p)
{
if(p==n)
{
int i;
for(i=0;i<n;i++)t[i]=d[i];
for(i=0;i<m;i++)
{
if(w[i]==0)t[x[i]]=(t[y[i]]+t[z[i]])%4;
if(w[i]==1)t[x[i]]=t[y[i]]^t[z[i]];
if(w[i]==2)t[x[i]]=(t[y[i]]+z[i])%4;
if(w[i]==3)t[x[i]]=t[y[i]]^z[i];
}
for(i=0;i<n;i++)r[i]=(r[i]+t[i])%4;
return;
}
for(d[p]=0;d[p]<4;d[p]++)if(d[p]!=a[p])dfs(p+1);
}
void dfs2(int p,int q)
{
if(p==n)
{
int i,j,k;
for(i=0;i<n;i++)for(j=0;j<n;j++)eff[i][j]=0;
for(i=0;i<n;i++)
{
t[i]=d[i];
eff[i][i]=1;
}
for(i=0;i<m;i++)
{
if(w[i]==0)
{
t[x[i]]=(t[y[i]]+t[z[i]])%4;
for(j=0;j<n;j++)eff[x[i]][j]=eff[y[i]][j]^eff[z[i]][j];
}
if(w[i]==1)
{
t[x[i]]=t[y[i]]^t[z[i]];
for(j=0;j<n;j++)eff[x[i]][j]=eff[y[i]][j]^eff[z[i]][j];
}
if(w[i]==2)
{
t[x[i]]=(t[y[i]]+z[i])%4;
for(j=0;j<n;j++)eff[x[i]][j]=eff[y[i]][j];
}
if(w[i]==3)
{
t[x[i]]=t[y[i]]^z[i];
for(j=0;j<n;j++)eff[x[i]][j]=eff[y[i]][j];
}
}
for(i=0;i<n;i++)
{
r[i]=(r[i]+t[i]*q)%4;
for(j=0;j<n;j++)if(eff[i][j]&&d[j]!=a[j]&&(d[j]^2)!=a[j])break;
if(j<n)r[i]=(r[i]+q)%4;
}
return;
}
for(d[p]=0;d[p]<2;d[p]++)
{
if(d[p]==a[p])d[p]^=2;
dfs2(p+1,q*((d[p]!=a[p])+((d[p]^2)!=a[p])));
if(d[p]>=2)d[p]^=2;
}
}
int main()
{
int i;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)scanf("%d",&a[i]);
for(i=0;i<m;i++)scanf("%d%d%d%d",&w[i],&x[i],&y[i],&z[i]);
dfs2(0,1);
for(i=0;i<n;i++)printf("%d ",r[i]);
}
