#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;
	int t[N];
	
	scanf("%d%d", &n,&m);
	
	for (i=1;i<=m;i++)
	{
		scanf ("%d%d", &x,&y);
		v[x].push_back(y);
		t[y]++;
	}
	
	for (i=1;i<=n;i++)
		if (!t[i])
			sol[++S]=i;
}

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

void sortare_topologica()
{
	int i,pr=1;
	
	while (pr<=S)
	{
		dfs(sol[pr], 1);
		pr++;
	}
	
	for (i=1;i<=S;i++)
		printf ("%d ", sol[i]);

}

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