#include <vector>
#include <fstream>
#include <iostream>

#define MAXN 50001

using namespace std;

vector<int> nodes[MAXN], order;
int seen[MAXN], sources[MAXN];

void dfs(int i) {

	seen[i] = 1;

	vector<int> :: iterator it;
	for (it=nodes[i].begin(); it != nodes[i].end(); it++ )
		if (seen[*it] != 1)
			dfs(*it);

	order.push_back(i);

}

int main() {

	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);
	
	int n, m;
	scanf("%d %d", &n, &m);

	for (int i = 0; i < m; i++) {
		int source, dest;
		scanf("%d %d", &source, &dest);
		nodes[dest].push_back(source);
		sources[source] = 1;
	}

	for (int i = 1; i <= n; i++)
		if (sources[i] == 0)
			dfs(i);

	for (int i = 0; i < n -1; i++ )
		printf("%d ", order[i]);

	printf("%d\n", order[n -1]);
}