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

using namespace std;
typedef unsigned int uint;

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