#include <cstdio>
#include <vector>
#include <bitset>
#include <algorithm>

using namespace std;

const int MAX = 5e4 + 5;
int n, m;
vector<int> gr[MAX];
vector<int> v;
bitset<MAX> viz;

void dfs(int node) {
	viz[node] = 1;
	for (auto it: gr[node]) 
		if (!viz[it])
			dfs(it);
	v.push_back(node);
}

int main() {
	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for (int a, b, i = 1; i <= m; i++) {
		scanf("%d%d", &a, &b);
		gr[a].push_back(b);
	}

	for (int i = 1; i <= n; i++)
		if (!viz[i])
			dfs(i);

	reverse(v.begin(), v.end());
	for (auto it: v) 
		printf("%d ", it);

	return 0;	
}