#include <bits/stdc++.h>
using namespace std;
#define maxn 10010
#define itn int
#define fro for
const int N = 1e5 + 10;
vector<int> G[N];
int v[N];
bool vis[N];
void dfs(int x, int n)
{
    if (v[x] < n)
    {
        v[x] = n;
    }
    else
    {
        return;
    }
    vis[x] = true;
    for (int i = 0; i < G[x].size(); i++)
    {
        if (vis[G[x][i]])
            dfs(G[x][i], n);
    }
    vis[x] = false;
}
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y;
        cin >> x >> y;
        G[y].push_back(x);
    }
    for (int i = n; i >= 1; i--)
    {
        dfs(i, i);
    }
    for (int i = 1; i <= n; i++)
    {
        cout << v[i] << " ";
    }
    return 0;
}