#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; }

int calc(const vector<pair<pii, int> > &items, const vi &ord) {
	int s = 0;
	rep(i, items.size()) {
		int a, b; tie(a, b) = items[i].first;
		if(ord[a] < ord[b])
			s += items[i].second;
	}
	return s;
}

int main() {
	int N; int M;
	while(~scanf("%d%d", &N, &M)) {
		vector<pair<pii, int> > items(M);
		rep(i, M) {
			int a, b, c;
			scanf("%d%d%d", &a, &b, &c);
			items[i] = mp(mp(a, b), c);
		}
		vi ord(N);
		iota(all(ord), 0);
		int score = -1;
		vi ans;
		rep(iter, 100) {
			int s = calc(items, ord);
			if(score < s) {
				score = s;
				ans = ord;
			}
			int none = 0;
			rep(k, 10000) {
				int a = rand() % N, b = rand() % N;
				swap(ord[a], ord[b]);
				int ns = calc(items, ord);
				if(ns > s) {
					s = ns;
					if(score < s) {
						score = s;
						ans = ord;
					}
					none = 0;
				} else {
					swap(ord[a], ord[b]);
					if(++ none == 1000)
						break;
				}
			}

			random_shuffle(all(ord));
		}

		printf("%d\n", score);
		vi invans(N);
		rep(i, N)
			invans[ans[i]] = i;
		for(int i = 0; i < N; ++ i) {
			if(i != 0) putchar(' ');
			printf("%d", invans[i]);
		}
		puts("");
	}
	return 0;
}