#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");


vector < vector <int> > v(50005);
vector <int> viz(50005);
vector <int> sol;

void dfs(int node)
{
	viz[node] = 1;
	for(int i = 0; i < v[node].size(); i++) {
		int neigh = v[node][i];
		if(!viz[neigh])
			dfs(neigh);
	}
	sol.push_back(node);
}

int main()
{
	int n, m;

	f >> n >> m;

	for(int i = 0; i < m; i++){
		int a, b;
		f >> a >> b;
		v[b].push_back(a);
	}

	for(int i = 1; i <= n; i++){
		if(viz[i] == 0){
			dfs(i);
		}
	}

	for(int i = 0; i < sol.size(); i++)
		g << sol[i] << ' ';

	return 0;
}