#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }


#ifdef WIN32
extern "C" unsigned __stdcall GetTickCount(void);
double getTime() { return GetTickCount() / 1e3; }
#else
#include <sys/time.h>
double getTime() {
	struct timeval tv;
	gettimeofday(&tv, NULL);
	return tv.tv_sec + tv.tv_usec / 1e6;
}
#endif
 
int main() {
	int N, M;
	scanf("%d%d", &N, &M);
	vector<vi> score(N, vi(N, 0));
	rep(i, M) {
		int A, B, C;
		scanf("%d%d%d", &A, &B, &C);
		score[A][B] = C;
	}
	vi ansperm; int anss = -1;
	vi perm(N);
	rep(i, N) perm[i] = i;
	double start = getTime();
	while(getTime() - start < 1) {
		random_shuffle(all(perm));
		int s = 0;
		rep(i, N) reu(j, i+1, N)
			s += score[perm[i]][perm[j]];
		if(anss < s) {
//			cerr << s << endl;
			anss = s;
			ansperm = perm;
		}
	}
	printf("%d\n", anss);
	rep(i, N)
		printf("%d\n", ansperm[i]);
	return 0;
}