#include <vector>
#include <fstream>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#define N_MAX 50011

using namespace std;
int grad[N_MAX];
vector< int > v;
vector< int > G[N_MAX];
vector< int >::const_iterator it, iend;	
int main( void )
{
	int N, M, x, y, i;
	ifstream in( "sortaret.in" );
	for( in>>N>>M; M; --M )
	{
		in>>x>>y;
		G[x].push_back(y);	
		++grad[y];
	}
	for( i=1; i <= N; ++i )
		if( 0 == grad[i] )
			v.push_back( i );
	for( i=0;  i <= v.size(); ++i )
	{
		for( it=G[v[i]].begin(), iend=G[v[i]].end(); it < iend; ++it )
		{
			--grad[*it];
			if( 0 == grad[*it] )
				v.push_back(*it);
		}
	}
	ofstream out( "sortaret.out" );
	copy( v.begin(), v.end(), ostream_iterator<int>( out, " " ) );
	out<<'\n';
	return EXIT_SUCCESS;
}