#include <algorithm>
#include <stdio.h>
#include <vector>

#define pb push_back
#define MAX 50010

using namespace std;

int n, m, noduriGs;
int vctNod[MAX], sel[MAX];
vector <int> listaFii[MAX];

void dfs(int nod)
{
	if (sel[nod])
		return;

	vctNod[noduriGs--] = nod;
	sel[nod] = 1;
	for (int i = 0; i < listaFii[nod].size(); i++)
		dfs(listaFii[nod][i]);
}

int main()
{
	freopen("sortaret.in", "r", stdin);
	freopen("sortaret.out", "w", stdout);

	scanf("%d %d", &n, &m);

	for (int i = 1; i <= m; i++)
	{
		int t, f;
		scanf("%d %d", &t, &f);

		listaFii[t].pb(f);
	}

	noduriGs = n;
	for (int i = n; i; i--)
			dfs(i);

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

	fclose(stdin);
	fclose(stdout);
	return 0;
}