#include <fstream>
#include <vector>
#include <map>
#include <iostream>

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

int n, m;
vector<int> G[50100], sol;
map<int, bool> viz;


void read() {
	fin >> n >> m;
	for (int i = 0; i < m; i++) {
		int x, y;
		fin >> x >> y;
		G[x].push_back(y);
	}
}

void dfs(int x) {
	viz[x] = true;
	for (int i = 0; i < G[x].size(); i++) {
		if (!viz[i]) {
			dfs(G[x][i]);
		}
	}
	sol.push_back(x);
}



int main() {
	read();
	for (int i = 1; i <= n; i++) {
		if (!viz[i])
			dfs(i);
	}
	for (int i = sol.size() - 1; i >= 0; i--) {
		fout << sol[i] << " ";
	}
	return 0;
}