import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


class XRand {
  uint x = 314159265, y = 358979323, z = 846264338, w = 327950288;
  void setSeed(uint seed) { w ^= seed * 65535; }
  uint next() { uint t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8; }
  uint nextInt(uint m) { return next() % m; }
  int nextInt(int a, int b) { return a + nextInt(b - a + 1); }
  ulong nextLong(ulong m) { return (next() | cast(ulong)(next()) << 32) % m; }
  long nextLong(long a, long b) { return a + nextLong(b - a + 1); }
  real nextReal() { return next() / 4294967296.0; }
}


enum NUM_ITERS = 10^^5;
enum TEMP_INIT = 1e100;
enum TEMP_RATE = 0.995;

int N, M;
int[] A, B, C;

void main() {
  auto rng = new XRand();
  
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      A = new int[M];
      B = new int[M];
      C = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt();
        B[i] = readInt();
        C[i] = readInt();
      }
      
      auto D = new int[][](N, N);
      foreach (i; 0 .. M) {
        D[A[i]][B[i]] += C[i];
      }
      
      auto us = iota(N).array;
      auto pos = iota(N).array;
      int score;
      foreach (i; 0 .. M) {
        if (A[i] < B[i]) {
          score += C[i];
        }
      }
      real temp = TEMP_INIT;
      foreach (iter; 0 .. NUM_ITERS) {
        int a, b;
        for (; ; ) {
          a = rng.nextInt(N);
          b = rng.nextInt(N);
          if (a != b) {
            if (pos[a] > pos[b]) {
              swap(a, b);
            }
            break;
          }
        }
        int scoreDiff;
        scoreDiff -= D[a][b];
        scoreDiff += D[b][a];
        foreach (u; us[pos[a] + 1 .. pos[b]]) {
          scoreDiff -= D[a][u];
          scoreDiff -= D[u][b];
          scoreDiff += D[b][u];
          scoreDiff += D[u][a];
        }
        if (scoreDiff > 0 || rng.nextReal() < exp(scoreDiff / temp)) {
          score += scoreDiff;
          stderr.writefln("iter = %s, score = %s", iter, score);
          swap(us[pos[a]], us[pos[b]]);
          swap(pos[a], pos[b]);
        }
        temp *= TEMP_RATE;
      }
      writeln(score);
      writeln(us.to!string.replaceAll(regex(`[\[\],]`), ""));
    }
  } catch (EOFException e) {
  }
}