#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second 
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define make_unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 Rng(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = 1e6 + 200;
const int M = 1e6;
const int inf = 2e9 + 3;
const ll INF = 1e18;

int n, m;
vector<int> g[N], h[N];

int ans[N];

int u[N];

vector<int> ord;
int pos[N], mx[N], mn[N];

void dfs(int v) {
    u[v] = 1;
    for (auto to : g[v]) {
        if (u[to]) continue;
        dfs(to);
    }
    ord.push_back(v);
}

bitset<1001> can[1001], nac[1001];

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        ans[i] = -1;
        can[i][i] = 1;
        nac[i][i] = 1;
    }
    if (n <= 0) {
        for (int i = 1, x, y; i <= m; ++i) {
            cin >> x >> y;
            g[x].push_back(y);
            can[x] |= can[y];
            nac[y] |= nac[x];
            for (int v = 1; v <= n; ++v) {
                if (can[v][x])
                    can[v] |= can[y];
                if (nac[v][y])
                    nac[v] |= nac[x];
            }
            for (int v = 1; v <= n; ++v) {
                if (ans[v] == -1 && (can[v] | nac[v]).count() == n) {
                    ans[v] = i;
                }
            }
        }
        for (int i = 1; i <= n; ++i)
            cout << ans[i] << " \n"[i == n];
        return 0;
    }
    for (int i = 1, x, y; i <= m; ++i) {
        cin >> x >> y;
        g[x].push_back(y);
        h[y].push_back(x);
    }
    for (int i = 1; i <= n; ++i) {
        if (u[i] == 0) dfs(i);
    }
    ord.push_back(0);
    reverse(all(ord));
    for (int i = 1; i <= n; ++i) {
        pos[ord[i]] = i;
    }
    for (int i = 1; i <= n; ++i) {
        mx[i] = 0;
        for (auto j : h[ord[i]]) {
            mx[i] = max(mx[i], pos[j]);
        }
    }
    for (int i = n; i >= 1; --i) {
        mn[i] = n + 1;
        for (auto j : g[ord[i]]) {
            mn[i] = min(mn[i], pos[j]);
        }
    }
    for (int i = 1; i <= n; ++i) {
        mn[i] = max(mn[i - 1], mn[i]);
    }
    mx[n + 1] = n + 1;
    for (int i = n; i >= 1; --i) {
        mx[i] = min(mx[i + 1], mx[i]);
    }
    for (int i = 1; i <= n; ++i) {
        if (mx[i + 1] >= i && mn[i - 1] <= i) ans[ord[i]] = m;
    }
    for (int i = 1; i <= n; ++i) {
        cout << ans[i] << " \n"[i == n];
    }
}