# include <stdio.h>
# include <vector>

using namespace std;
vector <int> g[200010];

int i,x,n,y,nc,m,timp,st[200010],p;
bool sel[200010];

void dfs(int x)
{
	sel[x]=true; 
	for (vector <int> :: iterator it=g[x].begin(); it!=g[x].end(); it++)
		if (sel[*it]==false)
			dfs(*it);
	st[++p]=x;
}

int main()

{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d %d\n",&n,&m);
	for (i=1; i<=m; i++)
	{
		scanf("%d %d\n",&x,&y);
		g[x].push_back(y);
	}
	timp=0;
	for (i=1; i<=n; i++)
	if (sel[i]==false)
	{
		nc++;
		dfs(i);
	}
	for (i=p; i>=1; i--)
		printf("%d ",st[i]);
	printf("\n");
	return 0;
}