//#include "train.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 42, INF = 1e9;
int n, m, nb[N], nbS[N];
bool isA[N], isR[N], sent[N];
vector<int> adj[N], ans, upd;
void dfs(int i) {
if(sent[i])
return;
sent[i] = true;
upd.push_back(i);
for(int j : adj[i]) {
nbS[j]++;
if(isA[j] || nbS[j] == nb[j])
dfs(j);
}
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
n = (int)a.size();
m = (int)u.size();
for(int i = 0; i < n; i++)
isA[i] = (a[i] == 1),
isR[i] = (r[i] == 1);
for(int i = 0; i < m; i++) {
nb[u[i]]++;
adj[v[i]].push_back(u[i]);
}
deque<int> id;
for(int i = 0; i < n; i++)
if(r[i])
id.push_back(i);
int sz = (int)id.size();
while(true) {
for(int j : id)
dfs(j);
for(int i = 0; i < sz; i++) {
if((isA[id[0]] && nbS[id[0]] > 0) || (!isA[id[0]] && nbS[id[0]] == nb[id[0]]))
id.push_back(id[0]);
id.pop_front();
}
for(int j : upd) {
nbS[j] = 0;
sent[j] = false;
}
upd.clear();
if(sz == (int)id.size())
break;
sz = id.size();
}
for(int i : id)
dfs(i);
for(int i = 0; i < n; i++)
ans.push_back(((isA[i] && nbS[i] > 0) || (!isA[i] && nbS[i] == nb[i])));
return ans;
}
