#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int>v[50100];
queue<int>c;
int d[50100],i,n,m,x,y,nr;
void par(int x)
{
	for(i=0;i<v[x].size();++i)
	{
	if(d[v[x][i]])
	{
	c.push(v[x][i]);
	g<<v[x][i]<<" ";
	d[v[x][i]]=0;
	}
	}
}
int main ()
{
	f>>n>>m;
	for(i=1;i<=m;++i)
	{
		f>>x>>y;
		v[x].push_back(y);
		d[y]=1;
	}
		for(i=1;i<=n;++i)
		{
			if(!d[i])
			{
				g<<i<<" ";
				d[i]=0;
				c.push(i);
			}
		}
		while(c.size())
		{
			par(c.front());
			c.pop();
		}
	return 0;
}