#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define int ll
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define sz(s) (int)s.size()

const int MAX=5e5+10;

int n,m;
vector<int> g[MAX],g1[MAX];
int use[MAX];
int ind[MAX],outd[MAX];
int ans[MAX];
bool was1[MAX],was2[MAX];

void solve(){
    cin>>n>>m;
    multiset<int> st;
    for(int i=1;i<=m;i++){
        int a,b;
        cin>>a>>b;
        g[a].pb(b);
        g1[b].pb(a);
        ind[b]++;
        outd[a]++;
    }
    for(int i=1;i<=n;i++){
        if(ind[i]==0)st.in(i);
    }
    while(!st.empty()){
        if(sz(st)==1){
            // cout<<*st.begin()<<"\n";
            ans[*st.begin()]++;
        }
        multiset<int> nw;
        for(auto v:st){
            for(auto to:g[v]){
                ind[to]--;
                if(ind[to]==0)nw.in(to);
            }
        }
        swap(nw,st);
    }
    st.clear();

    for(int i=1;i<=n;i++){
        if(outd[i]==0)st.in({outd[i],i});
    }
    while(!st.empty()){
        if(sz(st)==1){
            ans[*st.begin()]++;
        }
        multiset<int> nw;
        for(auto v:st){
            for(auto to:g1[v]){
                outd[to]--;
                if(outd[to]==0)nw.in(to);
            }
        }
        swap(nw,st);
    }
    st.clear();
    for(int i=1;i<=n;i++){
        if(ans[i]>0)cout<<1<<" ";
        else cout<<-1<<" ";
    }
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
}