#include <bits/stdc++.h>
using namespace std;
int N, M;
int F[18], A[18], B[18], ans[18];
struct Z{
int t, x, y, z;
} Q[401];
void dfs(int n)
{
if (n == N){
for (int i=0;i<N;i++) B[i] = A[i];
for (int i=1;i<=M;i++){
if (Q[i].t == 0){
B[Q[i].x] = (B[Q[i].y] + B[Q[i].z]) & 3;
}else if (Q[i].t == 1){
B[Q[i].x] = (B[Q[i].y] ^ B[Q[i].z]);
}else if (Q[i].t == 2){
B[Q[i].x] = (B[Q[i].y] + Q[i].z) & 3;
}else{
B[Q[i].x] = (B[Q[i].y] ^ Q[i].z);
}
}
for (int i=0;i<N;i++) ans[i] = (ans[i] + B[i]) & 3;
return;
}
for (int i=0;i<4;i++) if (i != F[n]){
A[n] = i;
dfs(n+1);
}
}
int main()
{
scanf("%d%d", &N, &M);
for (int i=0;i<N;i++) scanf("%d", F+i);
for (int i=1;i<=M;i++) scanf("%d%d%d%d", &Q[i].t, &Q[i].x, &Q[i].y, &Q[i].z);
dfs(0);
for (int i=0;i<N;i++) printf("%d ", ans[i]); puts("");
}
