#include <bits/stdc++.h>
using namespace std;
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u , vector<int> v){
int n = a.size();
int m = u.size();
vector<int > w(n);
vector<bool> iscycle(n, 0);
vector<bool> hasout(n, 0);
for(int i =0; i< m; i++){
if(u[i] == v[i]){
iscycle[u[i]] = true;
}
else
hasout[u[i]] = true;
}
for(int i =0; i< n; i++){
int winner = 0;
int energy = n;
int curstation = i;
while(curstation < n){
if(iscycle[i]){
if(a[i] && r[i]){
winner = 1;
break;
}
else if(!a[i] && !r[i]){
winner = 0;
break;
}
else if(a[i] && !r[i] && !hasout[i]){
winner = 0;
break;
}
else if(!a[i] && r[i] && !hasout[i]){
winner = 1;
break;
}
}
if(energy == 0){
winner = 0;
break;
}
energy--;
curstation++;
}
for(i = i; i<= min(curstation, n-1); i++){
w[i] = winner;
}
}
return w;
}
/*
int main(){
int n, m; cin >> n >>m;
vector<int> a(n), r(n), u(m) ,v(m);
for(int i = 0; i<n; i++){
cin >> a[i];
}
for(int i =0; i< n; i++)
cin >> r[i];
for(int i =0; i<m; i++)
cin >> u[i];
for(int i =0; i<m;i++)
cin >> v[i];
vector<int> w = who_wins(a,r,u,m);
for(int i=0; i< n ;i++)
cout << w[i]<<endl;
}*/
