#include <bits/stdc++.h>
using namespace std;
const int max_=1e5+5;
struct node{
    vector<int>v;
}a[max_];
int n,m,f[max_];
bool vis[max_];
int dfs(int x){
    vis[x]=1;
    if(f[x]){
        return f[x];
    }
    int ans=x;
    for(auto i:a[x].v){
        if(!vis[i]){
            ans=max(ans,dfs(i));
        }
    }
    f[x]=ans;
    return ans;
}
signed main()   
{
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr); 
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int x,y;
        cin>>x>>y;
        a[x].v.push_back(y);
    }
    for(int i=1;i<=n;i++){
        memset(vis,0,sizeof(vis));
        cout<<dfs(i)<<' ';
    }
    return 0;
}