#include <cstdio>
#include <vector>
using namespace std;
vector <int> a[50050];
vector <int> v,init;
int grad[50050];
int n,m;

void dfs(int p)
{
	v.push_back(p);
	for (int i=0;i<a[p].size();++i)
		if (grad[a[p][i]]>1)
			grad[a[p][i]]--;
		else
			dfs(a[p][i]);
}


int main()
{
	freopen ("sortaret.in","r",stdin);
	freopen ("sortaret.out","w",stdout);
	scanf("%d%d",&n,&m);
	int x,y;
	for (int i=1;i<=m;++i)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
		++grad[y];
	}
	for (int i=1;i<=n;++i)
		if (!grad[i])
			init.push_back(i);
	for (int i=0;i<init.size();++i)
		dfs(init[i]);
	for (int i=0;i<v.size();++i)
		printf("%d ",v[i]);
	return 0;
}