#include<iostream>
#include <cstring>
using namespace std;
const long long  N = 1e5;
long long h[N],e[N],ne[N],idx,A[N];
long long  n, m;
bool st[N];
void add(long long a, long long  b)
{
    e[idx] = b,ne[idx] = h[a],h[a] = idx++;
}
void dfs(long long x,long long d)
{   
    if(A[x]) return;
    A[x] = d;
    for(long long i = h[x]; i != -1; i = ne[i])
    {
      long long  j = e[i];
        dfs(j,d);
    }
}
int main()
{
    cin >> n >> m;
	memset(h, -1, sizeof h);
    while(m--)
    {
        long long  a, b;
        cin >> a >> b;
        add(b,a);
    }
    
   for(long long i = n; i >= 1; i--) dfs(i,i);
   for(long long i = 1; i <= n; i++) cout << A[i] << " ";
    return 0;
}