#include<iostream>
#include<stdio.h>
#include<vector>
#define MAX 100010
using namespace std;
vector <int> a[MAX];
vector <int> v(MAX,0),sorted,zap(MAX);
int n,m,x,y,i,nr,ult,ok;
void dfs(int nod)
{
	vector <int> ::iterator it;
	v[nod]=1;
	if(ok) zap[nod]=++nr;
	for(it=a[nod].begin();it!=a[nod].end();it++)
		if(!v[*it])
			dfs(*it);
}
int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
	}
	for(i=1;i<=n;i++)
		if(!v[i])
		{
			dfs(i);
			ult=i;
		}
	v.clear();v.resize(MAX,0);ok=1;dfs(ult);
	for(i=1;i<=n;i++)
		printf("%d ",zap[i]);
	return 0;
}