#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=105;
const int INF=10000000;
int dist[MAXN][MAXN],map[MAXN][MAXN];
int fa[MAXN][MAXN],path[MAXN];
int n,m,num,minc;
void Floyd()
{
int i,j,k,p,tmp;
minc=INF;
for(k=1;k<=n;k++)
{
for(i=1;i<k;i++)
for(j=i+1;j<k;j++)
{
tmp=dist[i][j]+map[i][k]+map[k][j];
if(tmp<minc) //找到更优解
{
minc=tmp;
num=0;
p=j;
while(p!=i) //逆向寻找前驱结点直到找到最前面的i,i->…->j
{
path[num++]=p;
p=fa[i][p];//fa[i][j]保存的不是k,而是fa[k][j].
}
path[num++]=i;
path[num++]=k;
}
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
tmp=dist[i][k]+dist[k][j];
if(dist[i][j]>tmp)
{
dist[i][j]=tmp;
fa[i][j]=fa[k][j];
}
}
}
}
int main()
{
freopen("in.txt","r",stdin);
int i,j,from,to,w;
while(scanf("%d%d",&n,&m)!=EOF) //n个点,m条边
{
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
map[i][j]=INF;
dist[i][j]=INF;
fa[i][j]=i;
}
while(m--)
{
scanf("%d%d%d",&from,&to,&w);
w=min(map[from][to],w);
//处理重边
map[from][to]=map[to][from]=dist[from][to]=dist[to][from]=w;
}
Floyd();
if(minc==INF)
printf("No solution.\n");
else
{
printf("minc = %d\n",minc);
printf("%d",path[0]);
for(i=1;i<num;i++)
printf(" %d",path[i]);
printf("\n");
}
}
return 0;
}