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

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

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);
		deps[y]++;
	}
}

void solve() {
	vector<int> sol;
	queue<int> noDeps;

	for (int i = 1; i <= N; i++) {
		if (!deps[i]) {
			noDeps.push(i);
		}
	}

	while (!noDeps.empty()) {
		int node = noDeps.front();
		noDeps.pop();
		sol.push_back(node);

		for (auto neighbour : G[node]) {
			deps[neighbour]--;
			if (deps[neighbour] == 0) {
				noDeps.push(neighbour);
			}
		}
	}
	
	for (auto node : sol) {
		cout << node << " ";
	}
	cout << "\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;
}