#include <cstdio>
#include <cstring>

using namespace std;

inline int next_int() {
	int d;
	scanf("%d", &d);
	return d;
}

const int N = 50005;
const int M = 100001;

int e;
int first[N], from[M], to[M], next[M];
bool seen[N];

void dfs(int u) {
	if (seen[u]) {
		return;
	}
	seen[u] = true;
	for (int e = first[u]; e != -1; e = next[e]) {
		int v = from[e];
		dfs(v);
	}
	printf("%d ", u);
}

int main() {
	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);
	memset(first, -1, sizeof first);
	int n = next_int();
	int m = next_int();
	for (int i = 0; i < m; i++) {
		int a = next_int();
		int b = next_int();
		from[e] = a;
		to[e] = b;
		next[e] = first[b];
		first[b] = e;
		e++;
	}
	for (int i = 1; i <= n; i++) {
		dfs(i);
	}
	return 0;
}