#include<fstream>
#include<vector>
#include<queue>
using namespace std;

vector <int> a[50001];
queue <int> c;
int b[50001],i,n,m,x,y;

int main()
{
	ifstream f("sortaret.in");
	ofstream g("sortaret.out");
	f >> n >> m;
	for (i=1;i<=m;i++)
	{
		f >> x >> y;
		a[x].push_back(y);
		b[y]++;
	}
	for (i=1;i<=n;i++)
		if (b[i]==0)
			c.push(i);
	while (!c.empty())
	{
		x=c.front();
		for (i=0;i<a[x].size();i++)
			if (--b[a[x][i]]==0)
				c.push(a[x][i]);
		g << x << ' ';
		c.pop();
	}
	return 0;
}