#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int NMAX = 50505;
vector<int> G[NMAX];
int N, M;

void read() {
	scanf("%d%d", &N, &M);
	int x, y;
	for (int edgeIdx = 0; edgeIdx < M; edgeIdx++) {
		scanf("%d%d", &x, &y);
		G[x].push_back(y);
	}
}

void dfs(int node, vector<bool>& visited, vector<int>& sol) {
	visited[node] = true;
	for (auto neighbour : G[node]) {
		if (!visited[neighbour]) {
			dfs(neighbour, visited, sol);
		}
	}

	sol.push_back(node);
}

void solve() {
	vector<int> sol;
	sol.reserve(N);
	vector<bool> visited(N + 1, false);
	for (int i = 1; i <= N; i++) {
		if (!visited[i]) {
			dfs(i, visited, sol);
		}
	}

	reverse(sol.begin(), sol.end());
	for (auto node : sol) {
		printf("%d ", node);
	}
	printf("\n");
}

int main() {
	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	read();
	solve();

	return 0;
}