//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#include "queue"
#include "train.h"
#define all(x) x.begin(), x.end()
using namespace std;
vector<vector<int>> g, gobr;
vector<int> exex, winner;
vector<int> generator, ruler;

vector<int> cnt, cntobr;
vector<int> exincor;
queue<int> todec;
bool play() {
    exincor = exex;
    int n = g.size();
    cnt.assign(n, {});
    cntobr.assign(n, {});
    for (int i = 0; i < n; ++i) {
        if (exex[i] and generator[i]) {
            todec.push(i);
            exincor[i] = 0;
        }
        if (exex[i]) {
            for (int j = 0; j < g[i].size(); ++j) {
                if (exex[g[i][j]] == 0) {
                    swap(g[i][j], g[i].back());
                    g[i].pop_back();
                    j--;
                }
            }
            cnt[i] = g[i].size();
            for (int j = 0; j < gobr[i].size(); ++j) {
                if (exex[gobr[i][j]] == 0) {
                    swap(gobr[i][j], gobr[i].back());
                    gobr[i].pop_back();
                    j--;
                }
            }
            cntobr[i] = gobr[i].size();
        }
    }
    while (!todec.empty()) {
        int v = todec.front();
        todec.pop();
        for (auto i : gobr[v]) {
            if (exincor[i]) {
                cnt[i]--;
                if (ruler[i] == 0) {
                    if (cnt[i] == 0) {
                        todec.push(i);
                        exincor[i] = 0;
                    }
                } else {
                    todec.push(i);
                    exincor[i] = 0;
                }
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        cnt[i] = g[i].size();
        if (exincor[i] == 1) {
            todec.push(i);
            exex[i] = 0;
        }
    }
    if (todec.empty())
        return 0;
    while (!todec.empty()) {
        int v = todec.front();
        todec.pop();
        for (auto i : gobr[v]) {
            if (exex[i]) {
                cnt[i]--;
                if (ruler[i] == 1) {
                    if (cnt[i] == 0) {
                        todec.push(i);
                        exex[i] = 0;
                    }
                } else {
                    todec.push(i);
                    exex[i] = 0;
                }
            }
        }
    }
    return 1;
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    int n = a.size();
    generator = move(r);
    ruler = move(a);
    g.assign(n, {});
    gobr.assign(n, {});
    exex.assign(n, 1);
    for (int i = 0; i < u.size(); ++i) {
        int uba = u[i];
        int veba = v[i];
        g[uba].push_back(veba);
        gobr[veba].push_back(uba);
    }
    while (play());
    return exex;
}
/*
int main() {
    int n, m;
    assert(2 == scanf("%d %d", &n, &m));

    vector<int> a(n), r(n), u(m), v(m);

    for(int i = 0; i < n; i++)
        assert(1 == scanf("%d", &a[i]));

    for(int i = 0; i < n; i++)
        assert(1 == scanf("%d", &r[i]));

    for(int i = 0; i < m; i++)
        assert(2 == scanf("%d %d", &u[i], &v[i]));

    vector<int> res = who_wins(a, r, u, v);

    for(int i = 0; i < (int)res.size(); i++)
        printf(i ? " %d" : "%d", res[i]);
    printf("\n");

    return 0;
}
*/