#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

#define MN 50001

int d[MN],n,m;

vector <int> a[MN],sol;

void read()
{
	scanf("%d %d",&n,&m);
	int x,y;
	for(;m>0;--m)
	{
		scanf("%d %d",&x,&y);
		a[x].push_back(y);
		++d[y];
	}
}

int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	
	read();
		

	for(int i=1;i<=n;++i)
		if(d[i]==0) sol.push_back(i);
	
	int x,y;
	for(size_t i=0;i<sol.size();++i)
	{
		x=sol[i];	
		for(size_t j=0;j<a[x].size();++j)
		{
			y=a[x][j];
			d[y]--;
			if(d[y]==0)
			{
				sol.push_back(y);
			}
		}
	}
	
	for(size_t i=0;i<sol.size();++i)
		printf("%d ",sol[i]);
	
	return 0;
}