#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];

int can[1001][1001];
int ans[N], now[N], d[N];

int sz = 0;
int u[N], C, pos[N];

void dfs(int v) {
    u[v] = C;
    for (auto to : g[v]) {
        if (u[to] == C) continue;
        dfs(to);
    }
    ++sz;
    if (pos[v] && pos[v] != sz) {
        ans[v] = -1;
    }
    pos[v] = sz;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) 
        ans[i] = -1;
    if (n <= 0) {
        vector<int> x(m), y(m);
        for (int i = 0; i < m; ++i) {
            cin >> x[i] >> y[i];
            now[x[i]] += (can[x[i]][y[i]] == 0);
            now[y[i]] += (can[x[i]][y[i]] == 0);
            can[x[i]][y[i]] = 1;
            for (int v = 1; v <= n; ++v) {
                if (can[y[i]][v]) {
                    now[v] += can[x[i]][v] == 0;
                    now[x[i]] += can[x[i]][v] == 0;
                    can[x[i]][v] = 1;
                }
                if (can[v][x[i]]) {
                    now[v] += can[v][y[i]] == 0;
                    now[y[i]] += can[v][y[i]] == 0;
                    can[v][y[i]] = 1;
                }
            }
            for (int v = 1; v <= n; ++v) if (now[v] == n - 1) ans[v] = i + 1, now[v] = n;
        }
        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);
        d[y]++;
    }
    C = 1;
    for (int i = 1; i <= n; ++i) {
        ans[i] = m;
        if (u[i] == 0) {
            dfs(i);
        }
    }
    int T = 500;
    while (T--) {
        vector<int> v(n);
        iota(v.begin(), v.end(), 1);
        shuffle(v.begin(), v.end(), rng);
        for (int i = 1; i <= n; ++i) 
            shuffle(g[i].begin(), g[i].end(), rng);
        ++C;
        sz = 0;
        for (int i : v) {
            if (u[i] != C) {
                dfs(i);
            }
        }
    }
    for (int i = 1; i <= n; ++i)
        cout << ans[i] << " \n"[i == n];
}