#include <bits/stdc++.h>
#define N 50005
using namespace std;

int n, m, postordine[N], nr;
bool o[N];
vector<int> G[N];

void DFS(int s)
{
	o[s] = 1;
	for (auto x: G[s])
		if (!o[x])
			DFS(x);

	postordine[++nr] = s;
}

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

	int i, x, y;
	for (i = 1; i <= m; i++)
	{
		scanf("%i%i", &x, &y);
		G[x].push_back(y);
	}
	for (i = 1; i <= n; i++)
		if (!o[i]) DFS(i);

	for (i = nr; i >= 1; i--)
		printf("%i ", postordine[i]);
	return 0;
}