#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
int N,M;
int S[50][50];
const int MaxTurn=1000;
const int SearchWidth=100;
main()
{
	cin>>N>>M;
	int initscore=0;
	for(int i=0;i<M;i++)
	{
		int u,v,c;cin>>u>>v>>c;
		S[u][v]=c;
		if(u<v)initscore+=c;
	}
	priority_queue<pair<int,vector<int> > >P;
	vector<int>initsort(N);
	for(int i=0;i<N;i++)initsort[i]=i;
	P.push(make_pair(initscore,initsort));
	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;
			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();
		}
	}
	pair<int,vector<int> >ans=P.top();
	cout<<ans.first<<endl;
	for(int i=0;i<N;i++)cout<<ans.second[i]<<(i+1==N?"\n":" ");
}