#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename T> vector<int32_t> normalize(vector<T> &arr){vector<int32_t> rv;rv.resize(arr.size());for (int i = 0; i < rv.size(); ++i){rv[i]=arr[i];}return rv;}
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define int long long
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "keys.h"
vector<int32_t> find_reachable(vector<int32_t> r, vector<int32_t> u, vector<int32_t> v, vector<int32_t> c) {
int n = r.size();
int m = u.size();
vector<vector<pair<int,int>>> arr(n);
for (int i = 0; i < m; ++i)
{
arr[u[i]].push_back({v[i],c[i]});
arr[v[i]].push_back({u[i],c[i]});
}
auto bfs = [&](int source)->int{
vector<bool> vis(n);
queue<int> q;
map<int,bool> al;
map<int,vector<int>> eds;
q.push(source);
int rv = 1;
while (q.size()){
int node = q.front();
q.pop();
if (vis[node]) continue;
rv++;
vis[node]=true;
al[r[node]]=true;
for (int i = 0; i < arr[node].size(); i++){
if (al[arr[node][i].second]){
q.push(arr[node][i].first);
}
else {
eds[arr[node][i].second].push_back(arr[node][i].first);
}
}
while (eds[r[node]].size()){
q.push(eds[r[node]].back());
eds[r[node]].pop_back();
}
}
return rv;
};
vector<int> ans(n);
for (int i = 0; i < n; i++){
ans[i]=bfs(i);
}
int mivi = *min_element(ans.begin(), ans.end());
for (int i = 0; i < n; ++i)
{
if (ans[i]==mivi) ans[i]=1;
else ans[i]=0;
}
return normalize(ans);
}
