#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int MX = 5*1e4+1;
int n, m, x, y;
vector<int> adj[MX], topo;
int v[MX], s[MX];

void dfs(int u) {
	v[u] = 1;
	for (int i = 0; i < adj[u].size(); i++) {
		if (!v[adj[u][i]]) 
			dfs(adj[u][i]);
	}
	topo.push_back(u);
}

int main() {
	freopen ("sortaret.in", "r", stdin);
	freopen ("sortaret.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for (int i = 0; i < MX; i++) {
		v[i] = 0;
		s[i] = 1;
	}
	for (int i = 0; i < m; i++) {
		scanf("%d%d", &x, &y);
		adj[x].push_back(y);
		s[y] = 0;
	}
	for (int i = 1; i <= n; i++) {
		if (!v[i]) 
			dfs(i);
	}
	reverse(topo.begin(), topo.end());
	for (int i = 0; i < topo.size(); i++) {
		printf("%d ", topo[i]);
	}
	return 0;
}