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

ifstream f("sortaret.in");
ofstream g("sortaret.out");

#define nmax 50002

vector <int> G[nmax];
int grad[nmax],N,M,Q[nmax];

void read_data()
{
	f>>N>>M; int x,y;
	for(;M;--M)
		f>>x>>y, ++grad[y], G[x].push_back(y);
}
void sortt()
{
	int i;
	vector <int>::iterator it;
	for(i=1;i<=N;++i)
		if(!grad[i]) Q[++Q[0]]=i;
	for(i=1;i<=N;++i)
		for(it=G[i].begin();it<G[i].end();++it)
		{
			--grad[*it];
			if(!grad[*it]) Q[++Q[0]]=*it;
		}
}
void write_data()
{
	int i;
	for(i=1;i<=N;++i) g<<Q[i]<<' ';
}
int main()
{
	read_data();
	sortt();
	write_data();
	return 0;
}