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

using std::vector;

#define maxn 50000
#define maxm 100000

vector<int> l, G[maxn];
bool viz[maxn];
int n, m, grad[maxn];

void citire()
{
	freopen("sortaret.in", "r", stdin);

	scanf("%d%d", &n, &m);
	int a,b;
	while(m--)
	{
		scanf( "%d%d", &a, &b);
		G[a].push_back(b);
		G[b].push_back(a);
		grad[b]++;
	}
}

void dfs(int x)
{
	viz[x] = 1;
	for(int i=0;i<G[x].size();i++)
	{
		viz[G[x][i]]=1;
		grad[G[x][i]]--;
		if(!grad[G[x][i]])
		{
			l.push_back(G[x][i]);
			dfs(G[x][i]);
		}
	}
}

int main()
{
	citire();

	for(int i=1;i<=n;i++)
	{
		if(!viz[G[i][0]] && grad[i]==0)
		{
			l.push_back(i);
			dfs(i);
		}
	}

	freopen("sortaret.out", "w", stdout);

	for(int i=0;i<l.size();i++)
	{
		printf("%d ", l[i]);
	}

	return 0;
}