#include <stdio.h>
#include <vector>
#define N 50005
using namespace std;
vector <int> v[N];
int n,m,S;
int sol[N],t[N];

void citire()
{
	int i,x,y;
	
	scanf("%d%d", &n,&m);
	
	for (i=1;i<=m;i++)
	{
		scanf ("%d%d", &x,&y);
		v[x].push_back(y);
	}
}

void dfs(int k)
{
	int i,L=v[k].size();
	t[k]=1;
	
	for (i=0;i<L;i++)
		if (t[v[k][i]]==0)
			dfs(v[k][i]);
	
	sol[++S]=k;
}

void sortare_topologica()
{
	int i;
	
	for (i=1;i<=n;i++)
		if (t[i]==0)
			dfs(i);
		
	for (i=S;i>=1;i--)
		printf ("%d ", sol[i]);

}

int main()
{
	freopen ("sortaret.in", "r", stdin);
	freopen ("sortaret.out", "w", stdout);
	
	citire();
	
	sortare_topologica();
	
	return 0;
}