#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <fstream>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int f(vector<int>& a, vector<int>& u, vector<int>& v, vector<int>& w) {
	int N = a.size(), M = u.size(), score = 0;
	for (int j = 0; j < M; j++)
		if (a[u[j]] < a[v[j]])
			score += w[j];
	return score;
}

int main() {
	int N, M; cin >> N >> M;
	vector<int> u(M), v(M), w(M);
	for (int j = 0; j < M; j++)
		cin >> u[j] >> v[j] >> w[j];
	vector<int> a(N);
	for (int i = 0; i < N; i++)
		a[i] = i;
	random_device rd;
	mt19937 mt(rd());
	int score = f(a, u, v, w);
	for (int t = 0; t < 1000000; t++) {
		int i = mt() % N, j = mt() % N;
		swap(a[i], a[j]);
		int _score = f(a, u, v, w);
		if (_score > score)
			score = _score;
		else
			swap(a[i], a[j]);
	}
	vector<int> b(N);
	for (int i = 0; i < N; i++)
		b[a[i]] = i;
	cout << score << endl;
	for (int i = 0; i < N; i++)
		cout << b[i] << ' ';
	cout << endl;
}