#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
using namespace std;
#define static_assert(...);
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bigInt __int128
#define int long long
#define dl double long
#define fl float
#define all(s) s.begin(), s.end()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pob_front
#define ins insert
#define F first
#define S second
#define len length
const int N = 100005;
const int M = 1005;
const int LN = 131072;
const int MOD = 1e9 + 7;//998244353;
const int BLOCK = 500;
int binpow(int a, int b) {//, int MOD) {
    int res = 1;
    a %= MOD;
    while (b > 0) {
        if (b & 1) {
            res = res * a;
            res %= MOD;
        }
        a = a * a;
        a %= MOD;
        b >>= 1;
    }
    return res;
}
int mdiv(int a, int b) {
    int ret = (a % MOD) * binpow(b, MOD - 2);
    ret %= MOD;
    return ret;
}
int mmul(int a, int b) {
    int ret = (a % MOD) * (b % MOD);
    ret %= MOD;
    return ret;
}
int madd(int a, int b) {
    int ret = (a % MOD) + (b % MOD);
    ret %= MOD;
    return ret;
}
int msub(int a, int b) {
    int ret = (a % MOD) - (b % MOD);
    ret = (ret + MOD) % MOD;
    return ret;
}
int GCD(int a, int b) {
    if (b == 0) {
        return a;
    }
    return GCD(b, a % b);
}
struct pqComp
{
    bool operator()(const pair<int, int>& p1, const pair<int, int>& p2) const
    {
        return (p1.F < p2.F) || (p1.F == p2.F && p1.S < p2.S);
    }
};
bool pCompF(pair<int, int>& p1, pair<int, int>& p2)
{
    return p1.F < p2.F;
}
bool pCompS(const pair<int, int>& p1, const pair<int, int>& p2)
{
    return p1.S < p2.S;
}
bool pCompFS(pair<int, int>& p1, pair<int, int>& p2)
{
    return (p1.S < p2.S) || (p1.S == p2.S && p1.F < p2.F);
}
vector <vector<int>> DS {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};
int n, m, lf[2*N], rg[2*N], vis[2*N];
vector<int> tp, g[2*N];
map<int,bool> can[2*N];

void dfs(int v) {
    vis[v] = 1;
    for (int u: g[v]) {
        if (vis[u]) continue;
        dfs(u);
    }
    tp.pub(v);
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int v, u; cin >> v >> u;
        g[v].pub(u);
        can[v][u] = 1;
    }
    for (int i = 1; i <= n; ++i) {
        if (!vis[i]) {
            dfs(i);
        }
    }
    tp.pub(0);
    reverse(all(tp));
    for (int i = 1; i <= n; ++i) {
        int l = i - 1;
        while (l >= 1 && can[tp[l]][tp[i]]) {
            l = lf[l];
        }
        lf[i] = l;
    }
    for (int i = n; i >= 1; --i) {
        int r = i + 1;
        while (r <= n && can[tp[i]][tp[r]]) {
            r = rg[r];
        }
        rg[i] = r;
    }
    vector<int> ans(n + 1);
    for (int i = 1; i <= n; ++i) {
        //cout << tp[i] << " : " << lf[i] << ' ' << rg[i] << '\n';
        if (lf[i] == 0 && rg[i] == n + 1) {
            ans[tp[i]] = 1;
        }
        else {
            ans[tp[i]] = -1;
        }
    }
    for (int i = 1; i <= n; ++i) {
        cout << ans[i] << ' ';
    }
}

signed main() {
    speed;
    int T = 1;
    //cin >> T;
    while (T--) {
        solve();
    }
}
/*
НЕ ЗАХОДИТ РЕШЕНИЕ?
1) ПРОВЕРЬ НА ОЧЕВИДНЫЕ ОШИБКИ В КОДЕ
2) ПРОВЕРЬ НА ПЕРЕПОЛНЕНИЯ
3) УБЕДИСЬ В ПРАВИЛЬНОСТИ АЛГОРИТМА
*/