#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>

using namespace std;


int n, m;

vector<int> sorted, visited;
unordered_map<int, vector<int>> v;

void dfs(int node) {

	visited[node] = 1;

	for (const auto& c : v[node]) {
		if (visited[c] == 0) {
			dfs(c);
		}
	}

	sorted.push_back(node);
}

int main() {
	ifstream in("sortaret.in");
	ofstream out("sortaret.out");

	in >> n >> m;
	visited = vector<int>(n+1);

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

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

	for (int i = n - 1; i >= 0; i--) {
		out << sorted[i] << " ";
	}
}