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

#define x first
#define y second
#define mk make_pair
typedef pair<int,int> PI;
int d[110000],vis[110000],p[110000];
PI la[110000];
vector<PI> e[110000],f[110000];
queue<int> q;
int n,m;

int main()
{
	freopen("insider.in","r",stdin);
	freopen("insider.out","w",stdout);
	int u,v,w,l,r;
	scanf("%d%d",&n,&m);
	for (int i=0;i<m;i++)
	{
		scanf("%d%d%d",&u,&v,&w);
		e[u].push_back(mk(v,i));
		e[w].push_back(mk(v,i));
		f[u].push_back(mk(v,w));
		f[w].push_back(mk(v,u));
		d[v]++;
	}
	for (int i=1;i<=n;i++)
	if (!d[i]) q.push(i);
	for (int i=0;i<n;i++)
	{
		u=q.front();
		q.pop();
		p[i]=u;
		for (int i=0;i<e[u].size();i++)
		{
			v = e[u][i].x;
			w = e[u][i].y;
			if (vis[w]) continue;
			d[v]--;
			vis[w]=1;
			if (!d[v]) q.push(v);
		}
	}
	l=n+1;r=n+2;
	for (int i=n-1;i>=0;i--)
	{
		u=p[i];
		la[u].y=u;
		int tot1=0,tot2=0;
		for (int j=0;j<f[u].size();j++)
		{
			v=f[u][j].x;
			w=f[u][j].y;
			tot1+=la[v].x<la[w].x;
			tot2+=la[v].x>la[w].x;
		}
		if (tot1>tot2) la[u].x=l--;
		else la[u].x=r++;
	}
	sort(la+1,la+n+1);
	for (int i=1;i<=n;i++) printf("%d%c",la[i].y,"\n "[i<n]);
}