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

const int N = 105;
int n, m, ans[N];
vector<int> gout[N], gin[N];
bool vis[N];

void dfs_in(int v){
    vis[v] = 1;
    for (int u : gin[v])
        if (!vis[u])
            dfs_in(u);
}

void dfs_out(int v){
    vis[v] = 1;
    for (int u : gout[v])
        if (!vis[u])
            dfs_out(u);
}

int main(){
    memset(ans, -1, sizeof ans);
    
    cin >> n >> m;
    for (int edge = 1; edge <= m; edge ++){
        int u, v;
        cin >> u >> v;
        gout[u].push_back(v);
        gin[v].push_back(u);

        for (int i = 1; i <= n; i ++){
            if (ans[i] != -1) continue;

            memset(vis, 0, sizeof vis);
            dfs_out(i);
            dfs_in(i);

            bool good = 1;
            for (int j = 1; j <= n; j ++)
                good &= vis[j];

            if (good)
                ans[i] = edge;
        }
    }

    for (int i = 1; i <= n; i ++)
        cout << ans[i] << " ";
    cout << endl;
}