#include<iostream>
#include<queue>
#include<algorithm>
#include<random>
using namespace std;
int N,M;
int S[50][50];
const int attempt=1000;
const int MaxTurn=100;
const int SearchWidth=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++)
	{
		priority_queue<pair<int,vector<int> > >P;
		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]];
		P.push(make_pair(cstate,fstate));
		for(int turn=0;turn<MaxTurn;turn++)
		{
			priority_queue<pair<int,vector<int> > >Q;
			while(!P.empty())
			{
				int ns=P.top().first;
				vector<int>id=P.top().second;
				Q.push(P.top());
				P.pop();
				for(int i=0;i+1<N;i++)
				{
					int ts=ns;
					ts-=S[id[i]][id[i+1]];
					ts+=S[id[i+1]][id[i]];
					swap(id[i],id[i+1]);
					Q.push(make_pair(ts,id));
					swap(id[i],id[i+1]);
				}
			}
			for(int i=0;i<SearchWidth;i++)
			{
				if(Q.empty())break;
				P.push(Q.top());
				Q.pop();
			}
		}
		ans=max(ans,P.top());
	}
	cout<<ans.first<<endl;
	for(int i=0;i<N;i++)cout<<ans.second[i]<<(i+1==N?"\n":" ");
}