#include <bits/stdc++.h>
#define fi first
#define se second
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#ifndef hkoi
#include "train.h"
#endif
using namespace std;
const int N = 5001, M = 20001;
int n, m;
vector<pair<int, int>> G[N], H[N];
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
::n = a.size(), ::m = u.size();
std::vector<int> losed(n, 0), ans(n, 0);
std::vector<bool> self(n, 0);
for(int i = 0; i < n; i++){
G[i].clear(); H[i].clear();
}
for(int i = 0; i < m; i++){
G[u[i]].push_back({v[i], i});
H[v[i]].push_back({u[i], i});
if(u[i] == v[i])
self[u[i]] = true;
}
for(int tr = 0; tr < n; tr++){
bool changing = false;
std::vector<int> charged(n, 0), cnt(n, 0);
deque<pair<int, int>> dq;
vector<bool> used(m, 0);
for(int i = 0; i < n; i++) if(r[i] && !losed[i]) charged[i] = true;
vector<bool> rch(n, 0); for(int i = 0; i < n; i++) if(charged[i]) rch[i] = true;
for(int j = 0; j < n; j++){
if(charged[j] == true){
for(auto& [k, id] : H[j]){
used[id] = true;
cnt[k]++; dq.push_back({(a[k] << 16) + cnt[k], k});
}
}
}
while(dq.size()){
pair<int, int> t = dq.front(); dq.pop_front();
int v = t.se;
if(t.fi >= G[v].size()) {
if(charged[v]) continue;
charged[v] = true;
for(auto& [k, id] : H[v]){
if(charged[k] || used[id]) continue;
used[id] = true;
cnt[k]++; dq.push_back({(a[k] << 16) + cnt[k], k});
}
}
}
used.clear();
fill(cnt.begin(), cnt.end(), 0);
for(int j = 0; j < n; j++){
if(!charged[j]){
if(!losed[j]) changing = true;
losed[j] = true;
for(auto& [k, id] : H[j]){
if(losed[k]) continue;
used[id] = true;
cnt[k]++; dq.push_back({((!a[k]) << 16) + cnt[k], k});
}
}
}
while(dq.size()){
pair<int, int> t = dq.front(); dq.pop_front();
int v = t.se;
if(t.fi >= G[v].size() - (!rch[v] && self[v])) {
if(losed[v]) continue;
changing = true; losed[v] = true;
for(auto& [k, id] : H[v]){
if(losed[k] || used[id]) continue;
used[id] = true;
cnt[k]++; dq.push_back({((!a[k]) << 16) + cnt[k], k});
}
}
}
if(!changing) break;
}
for(int u = 0; u < n; u++){
ans[u] = !losed[u];
}
return ans;
}
#ifdef hkoi
int main(){
int n, m; cin >> n >> m;
vector<int> a; for(int i = 0; i < n; i++) {
int v; cin >> v; a.push_back(v);
}
vector<int> r; for(int i = 0; i < n; i++) {
int v; cin >> v; r.push_back(v);
}
vector<int> u, v; for(int i = 0; i < m; i++){
int x, y; cin >> x >> y;
u.push_back(x); v.push_back(y);
}
vector<int> w = who_wins(a, r, u, v);
for(int i = 0; i < n; i++){
cout << w[i] << ' ';
}
cout << '\n';
}
#endif
