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

#define MAXN 50005

int N, M;
vector<int> G[MAXN];
vector<int> ret;
char viz[MAXN];

void ReadData() {
	cin >> N >> M;
	for (int i = 0; i < M; ++i) {
		int a, b;
		cin >> a >> b;
		G[a].push_back(b);
	}
}

void DF(int nod) {
	viz[nod] = 1;
	for (vector<int>::iterator it = G[nod].begin(); it != G[nod].end(); ++it)
		if (!viz[*it])
			DF(*it);
	ret.push_back(nod);
}

void Solve() {
	for (int i = 1; i <= N; ++i)
		if (!viz[i])
			DF(i);
	reverse(ret.begin(), ret.end());
	for (vector<int>::iterator it = ret.begin(); it != ret.end(); ++it)
		cout << *it << ' ';
}

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

	ReadData();
	Solve();
}