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

const int maxN = 2e5 + 5;
bool visited[maxN];
int x[4 * maxN], y[4 * maxN];
vector<pair<int, int>> adj[maxN];

void dfs(int u, int tick, int type) {
    visited[u] = true;
    for (auto it: adj[u]) {
        int v = it.first, w = it.second;
        if (visited[v] || type * w < 0 || abs(w) > tick) continue;
        dfs(v, tick, type);
    }
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= m; i++) {
        cin >> x[i] >> y[i];
        adj[x[i]].push_back({y[i], i});
        adj[y[i]].push_back({x[i], -i});
    }

    if (n == 1) {
        cout << 0;
        return 0;
    }

    for (int u = 1; u <= n; u++) {
        int low = 1, high = m, ans = -1;
        while (low <= high) {
            int mid = (low + high) >> 1;

            dfs(u, mid, -1);
            dfs(u, mid, 1);

            int cnt = 0;
            for (int v = 1; v <= n; v++) {
                cnt += visited[v];
                visited[v] = false;
            }

            if (cnt == n) {
                ans = mid;
                high = mid - 1;
            }
            else low = mid + 1;
        }
        cout << ans << ' ';
    }

    return 0;
}