#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))

const int MAX=5e5+10;

int n,m;
vector<int> g[MAX],g1[MAX];
int use[MAX];

vector<int> top;

void dfs(int v){
    use[v]=1;
    for(auto to:g[v]){
        if(!use[to])dfs(to);
    }
    top.pb(v);
}

int pos[MAX];
int l[MAX],r[MAX];

bool cmp(int a,int b){
    return pos[a]<pos[b];
}

void solve(){
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int a,b;
        cin>>a>>b;
        g[a].pb(b);
        g1[b].pb(a);
    }
    {
        mem(use,0);
        for(int i=1;i<=n;i++){
            if(!use[i]){
                dfs(i);
            }
        }
        mem(use,0);
        reverse(all(top));
        for(int i=0;i<n;i++)pos[top[i]]=i;
        for(int i=1;i<=n;i++){
            // cout<<pos[i]<<" ";
            sort(all(g1[i]),cmp);
            reverse(all(g1[i]));
            sort(all(g[i]),cmp);
        }
        // cout<<"\n";
        // for(int x:top)cout<<x<<" ";
        // cout<<"\n";
        for(int i=0;i<n;i++){
            int v=top[i];
            l[v]=i;
            for(auto to:g1[v]){
                if(pos[to]>=l[v]-1){
                    l[v]=min(l[v],l[to]);
                }
            }
        }
        for(int i=n-1;i>=0;i--){
            int v=top[i];
            r[v]=i;
            for(auto to:g[v]){
                // cout<<"! "<<v<<" "<<to<<"\n";
                if(pos[to]<=r[v]+1){
                    r[v]=max(r[v],r[to]);
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        // cout<<l[i]<<" "<<r[i]<<"\n";
        if(l[i]==0&&r[i]==n-1)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();
}