#include "train.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

const int N = 5005;

int n, m;
int a[N], r[N];
vector<int> g[N], gr[N];
int kek[N];
int cnt[N];

}

vector<int> who_wins(vector<int> grda, vector<int> grdr, vector<int> grdu, vector<int> grdv) {
	n = grda.size();
	for (int i = 0; i < n; ++i) {
		a[i] = grda[i];
	}
	for (int i = 0; i < n; ++i) {
		r[i] = grdr[i];
	}
	m = grdu.size();
	for (int i = 0; i < m; ++i) {
		int u = grdu[i];
		int v = grdv[i];
		g[u].push_back(v);
		gr[v].push_back(u);
	}
	while (true) {
		bool was = 0;
		queue<int> q;
		for (int i = 0; i < n; ++i) {
			kek[i] = 0;
			if (r[i] == 1) {
				q.push(i);
				kek[i] = 1;
			}
		}
		for (int i = 0; i < n; ++i) {
			if (a[i] == 0) {
				cnt[i] = g[i].size();
			} else {
				cnt[i] = 1;
			}
		}
		while (!q.empty()) {
			int v = q.front();
			q.pop();
			for (int u : gr[v]) {
				--cnt[u];
				if (!kek[u] && cnt[u] == 0) {
					q.push(u);
					kek[u] = 1;
				}
			}
		}
		for (int i = 0; i < n; ++i) {
			if (r[i] == 1) {
				int lol = 0;
				if (a[i] == 1) {
		 			for (int j : g[i]) {
		 				lol |= kek[j];
					}
				} else {
					lol = 1;
					for (int j : g[i]) {
						lol &= kek[j];
					}
				}
				if (!lol) {
					r[i] = 0;
					was = 1;
				}
			}
		}
		if (!was) {
			break;
		}
	}
	vector<int> ret;
	for (int i = 0; i < n; ++i) {
		ret.push_back(kek[i]);
	}
	return ret;
}