#include <cstdio>
#include <vector>
#include <cstring>

using namespace std;

#define NMAX 50001
#define pb push_back

int Stiva[NMAX];
vector< int > G[NMAX];
int N, M, i, x, y;
bool Used[NMAX];

inline void Df( int Nod )
{
	Used[Nod] = true;
	
	for( vector< int >::iterator it = G[Nod].begin(); it != G[Nod].end(); ++it )
		if( !Used[*it] )
			Df( *it );
	
	Stiva[ ++Stiva[0] ] = Nod;
}

int main()
{
	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);
	
	scanf("%d%d", &N, &M );
	for( ; M--; )
	{
		scanf("%d%d", &x, &y );
		G[x].pb( y );
	}
	
	memset( Used, false, sizeof(Used) );
	Stiva[0] = 0;
	
	for( i = 1; i <= N; ++i )
		if( !Used[i] )
			Df( i );
	
	for( i = Stiva[0]; i; --i )
		printf("%d ", Stiva[i] );
	printf("\n");
	
	return 0;
}