#include <bits/stdc++.h>

using namespace std;

int main() {
	#ifdef BLAT
		freopen("input", "r", stdin);
	#else
		freopen("sortaret.in", "r", stdin);
		freopen("sortaret.out", "w", stdout);
	#endif

	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int n, m;
	cin >> n >> m;

	vector< vector< int > > gr(n + 1);
	vector< int > deg(n + 1);

	for(int i = 0; i < m; ++i) {
		int a, b;
		cin >> a >> b;

		deg[b] ++;
		gr[a].emplace_back(b);
	}

	queue< int > q;
	for(int i = 1; i <= n; ++i) if(!deg[i]) q.push(i);

	while(q.size()) {
		int node = q.front();
		q.pop();

		cout << node << ' ';
		for(auto &x : gr[node]) {
			deg[x]--;
			if(!deg[x]) q.push(x);
		}
	}

	
	return 0;
}