#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <climits>
using namespace std;
int n, m, x, y, in[50005];
vector <int> v[50005];
queue<int> q;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int main() {
	fin >> n >> m;
	for (int i = 1; i <= m; i++) {
		fin >> x >> y;
		in[y]++;
		v[x].push_back(y);
	}
	for (int i = 1; i <= n; i++)
		if (in[i] == 0) q.push(i);
	while (!q.empty()) {
		int cr = q.front();
		fout << cr << " ";
		q.pop();
		for (auto el : v[cr]) {
			in[el]--;
			if (in[el] == 0) q.push(el);
		}
	}
}