#include <bits/stdc++.h>
using namespace std;
int n, m, u, v, ans;
vector<int> g[1005];
bool vis[1005];//每个点是否访问过
void dfs(int u)
{
    vis[u] = true;
    ans = max(ans, u);
    for (int i = 0; i < g[u].size(); i++)
        if (!vis[g[u][i]])
            dfs(g[u][i]);
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        cin >> u >> v;
        g[u].push_back(v);
    }
    for (int i = 1; i <= n; i++) {
        ans = 0;
        memset(vis, false, sizeof(vis));
        dfs(i);
        cout << ans << " ";
    }
	return 0;
}