#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

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=2e5+10;

int n,m;
vector<int> g[MAX],g1[MAX];
bool ok[MAX];
ll dp[MAX],dp1[MAX];

vector<int> top;
vector<int> top1;
bool use[MAX];

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

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);
    }
    for(int i=1;i<=n;i++){
        ok[i]=1;
        if(!use[i])dfs(i);
    }
    top1=top;
    reverse(all(top1));
    int B=60;
    for(int i=1;i<=n;i+=B){
        mem(dp,0),mem(dp1,0);
        int l=i,r=min(n,i+B-1);
        for(auto v:top){
            if(l<=v&&v<=r)dp[v]+=(1ll<<(v-l));
            for(auto to:g[v]){
                dp[v]|=dp[to];
            }
        }
        for(auto v:top1){
            if(l<=v&&v<=r)dp1[v]+=(1ll<<(v-l));
            for(auto to:g1[v]){
                dp1[v]|=dp1[to];
            }     
        }
        for(int v=1;v<=n;v++){
            if(__builtin_popcountll(dp[v]|dp1[v])!=r-l+1){
                ok[v]=0;
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(ok[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();
}