#include<iostream>
#include<queue>
#include<algorithm>
#include<random>
using namespace std;
int N,M;
int S[50][50];
const int attempt=200;
const int MaxTurn=10000;
const int swapwd=5;
main()
{
	cin>>N>>M;
	for(int i=0;i<M;i++)
	{
		int u,v,c;cin>>u>>v>>c;
		S[u][v]=c;
	}
	mt19937 rng(0);
	pair<int,vector<int> >ans{};
	for(int atc=0;atc<attempt;atc++)
	{
		vector<int>fstate(N);
		for(int i=0;i<N;i++)fstate[i]=i;
		shuffle(fstate.begin(),fstate.end(),rng);
		int cstate=0;
		for(int i=0;i<N;i++)for(int j=i+1;j<N;j++)cstate+=S[fstate[i]][fstate[j]];
		pair<int,vector<int> >p=make_pair(cstate,fstate);
		for(int turn=0;turn<MaxTurn;turn++)
		{
			int ts=p.first;
			int id=rng()%(N-1);
			int wd=rng()%min(N-id-1,swapwd-1)+1;
			ts-=S[p.second[id]][p.second[id+wd]];
			ts+=S[p.second[id+wd]][p.second[id]];
			for(int i=1;i<wd;i++)
			{
				ts-=S[p.second[id]][p.second[id+i]];
				ts-=S[p.second[id+i]][p.second[id+wd]];
				ts+=S[p.second[id+wd]][p.second[id+i]];
				ts+=S[p.second[id+i]][p.second[id]];
			}
			if(p.first<ts||p.first==ts&&rng()%2==1)
			{
				p.first=ts;
				swap(p.second[id],p.second[id+wd]);
			}
		}
		ans=max(ans,p);
	}
	cout<<ans.first<<endl;
	for(int i=0;i<N;i++)cout<<ans.second[i]<<(i+1==N?"\n":" ");
}