#include <iostream>
#include <fstream>
#include <list>
#include <vector>
#include <algorithm>

using namespace std;

static const int WHITE = 0;
static const int GREY = 1;
static const int BLACK = 2;

vector<pair<int,int> > edges;
vector<int> colors(50001,WHITE);
list<int> rez;

void visit(int n)
{
	colors[n] = GREY;
	for( vector<pair<int,int> >::iterator it = edges.begin(); it != edges.end(); ++it )
	{
		if ( it->first == n )
		{
			if ( colors[it->second] == WHITE )
			{
				visit(it->second);
			}
		}
	}
	colors[n] = BLACK;
	rez.push_front( n );
}

void sort_top(int N)
{
	for ( int i = 1; i <= N; ++i )
	{
		if ( colors[i] == WHITE )
		{
			visit(i);
		}
	}
}

int main( int argc, char* argv[] )
{
	ifstream inputFile ("sortaret.in");
	ofstream outputFile ("sortaret.out");
	int N, M;
	inputFile >> N >> M;
	for ( int i = 0; i < M; ++i )
	{
		int first, second;
		inputFile >> first >> second;
		edges.push_back( pair<int,int>( first,second ) ); 
	}
	sort_top(N);
	for ( list<int>::iterator it = rez.begin(); it != rez.end(); ++it )
	{
		outputFile << *it << " ";
	}

	inputFile.close();
	outputFile.close();
	return 0;
}