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

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