#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

const int Dim = 5e4 + 5;

vector < int > G[Dim];
int n,m,g[Dim];
int sol[Dim],viz[Dim];

void Dfs(int x) {
	
	viz[x] = 1;
	for ( auto y : G[x])
		if ( !viz[y])
			Dfs(x);
	sol[++sol[0]] = x;
}


int main() {
	
	fin  >> n >> m;
	int x,y;
	for ( ; m > 0; --m) {
		fin >> x >> y;
		G[x].push_back(y);
	
	}
	for ( int i = 1; i <= n; ++i)
		if( !viz[i])
			Dfs(x);
	
	for ( int i = sol[0]; i >= 1; --i)
		fout << sol[i] << " ";
}