#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define nmax 50005
using namespace std;

vector <int> vecin[nmax];
vector <int> sol;

void dfs(int curent) {	
	for(int i=0; i<vecin[curent].size(); i++)
		dfs(vecin[curent][i]);

	sol.push_back(curent);
}	

int main() {
	ifstream f("sortaret.in");
	ofstream g("sortaret.out");
	
	int a, b, n, m;

	f>>n>>m;
	for(int i=1; i<=m; i++) {
		f>>a>>b;
		vecin[a].push_back(b);
	}

	dfs(1);

	reverse(sol.begin(), sol.end());
	for(int i=0; i<sol.size(); i++) g<<sol[i]<<" ";
	g<<"\n";

	return 0;
}