Problem: Mad scientist Mike has applied for a job. His task is to manage a system of water pumping stations.

The system consists of n pumping stations, which are numbered by integers from 1 to n. Some pairs of stations are connected by bidirectional pipes through which water can flow in either direction (but only in one at a time). For each pipe you know its bandwidth — the maximum number of liters of water that can flow through it in one hour. Each pumping station can pump incoming water from some stations to other stations through the pipes, provided that in one hour the total influx of water to the station is equal to the total outflux of water from the station.

It is Mike's responsibility to pump water between stations. From station a to station b through the pipes (possibly through other stations) within one hour one can transmit a certain number of liters of water according to the rules described above. During this time, water from other stations can not flow into station a, and can not flow out of the station b. However, any amount of water can flow out of station a or in station b. If a total of x litres of water flows out of the station a in an hour, then Mike gets x bollars more to his salary.

To get paid, Mike needs to work for n - 1 days, according to the contract. On the first day he selects two stations v1 and v2, and within one hour he pumps a certain amount of water from v1 to v2. Next, on the i-th day Mike chooses a station vi + 1 that has been never selected before, and pumps a certain amount of water out of the station vi to station vi + 1 for one hour. The quantity of water he pumps on the i-th day does not depend on the amount of water pumped on the (i - 1)-th day.

Mike needs to earn as much bollars as he can for his projects. Help Mike find such a permutation of station numbers v1, v2, ..., vn so Mike will be able to earn the highest possible salary.

Input

The first line of the input contains two space-separated integers n and m (2 ≤ n ≤ 200, 1 ≤ m ≤ 1000) — the number of stations and pipes in the system, accordingly. The i-th of the next m lines contains three space-separated integers ai, bi and ci (1 ≤ ai, bi ≤ n, ai ≠ bi, 1 ≤ ci ≤ 100) — the numbers of stations connected by the i-th pipe and the pipe's bandwidth, accordingly. It is guaranteed that any two stations are connected by at most one pipe and that there is a pipe path between any two stations.

Output

On the first line print a single integer — the maximum salary Mike can earn.

On the second line print a space-separated permutation of n numbers from 1 to n — the numbers of stations in the sequence v1, v2, ..., vn. If there are multiple answers, print any of them.

Examples

Input

6 11
1 2 10
1 6 8
2 3 4
2 5 2
2 6 3
3 4 5
3 5 4
3 6 2
4 5 7
4 6 2
5 6 3


Output

77
6 2 1 5 3 4 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 200 + 9;
struct EDGE {
  int from, to, cap, flow;
};
vector<EDGE> edges;
vector<int> c[maxn];
int S, T;
bool visit[maxn];
int depth[maxn];
int cur[maxn];
void clear_graph() {
  edges.clear();
  for (int i = 0; i < maxn; i++) c[i].clear();
}
void clear_flow() {
  int sz = edges.size();
  for (int i = 0; i < sz; i++) edges[i].flow = 0;
}
void addedge(int from, int to, int cap) {
  EDGE tmp = (EDGE){from, to, cap, 0};
  edges.push_back(tmp);
  tmp = (EDGE){to, from, cap, 0};
  edges.push_back(tmp);
  int tot = edges.size() - 2;
  c[from].push_back(tot);
  c[to].push_back(tot + 1);
}
bool BFS(void) {
  memset(visit, 0, sizeof(visit));
  memset(depth, -1, sizeof(depth));
  queue<int> Q;
  Q.push(S);
  visit[S] = true;
  depth[S] = 0;
  while (!Q.empty()) {
    int x = Q.front();
    Q.pop();
    for (int i = 0; i < c[x].size(); i++) {
      EDGE &now = edges[c[x][i]];
      if (!visit[now.to] && now.cap > now.flow) {
        visit[now.to] = true;
        depth[now.to] = depth[x] + 1;
        Q.push(now.to);
      }
    }
  }
  return visit[T];
}
int DFS(int x, int a) {
  if (x == T || !a) return a;
  int flow = 0, cf = 0;
  for (int i = cur[x]; i < c[x].size(); i++) {
    cur[x] = i;
    EDGE &now = edges[c[x][i]];
    if (depth[x] + 1 == depth[now.to]) {
      cf = DFS(now.to, min(a, now.cap - now.flow));
      if (cf) {
        flow += cf;
        a -= cf;
        now.flow += cf, edges[c[x][i] ^ 1].flow -= cf;
      }
      if (!a) break;
    }
  }
  if (!flow) depth[x] = -1;
  return flow;
}
int Dinic(void) {
  int flow = 0;
  while (BFS()) {
    memset(cur, 0, sizeof(cur));
    flow += DFS(S, inf);
  }
  return flow;
}
int N, M;
int fa[maxn], falen[maxn];
int now;
void find_min(int x, int fa) {
  for (int i = 0; i < c[x].size(); i++) {
    EDGE &e = edges[c[x][i]];
    if (e.to != fa && e.cap != -1) {
      if (now == -1 || e.cap < edges[now].cap) now = c[x][i];
      find_min(e.to, x);
    }
  }
}
void solve(int x) {
  now = -1;
  find_min(x, 0);
  if (now == -1) {
    printf("%d ", x);
    return;
  }
  edges[now].cap = edges[now ^ 1].cap = -1;
  int p = now;
  solve(edges[p].from);
  solve(edges[p].to);
}
int ans = 0;
void build_tree() {
  for (int i = 1; i <= N; i++) fa[i] = 1;
  for (int i = 2; i <= N; i++) {
    clear_flow();
    S = i, T = fa[i];
    falen[i] = Dinic();
    BFS();
    for (int j = i + 1; j <= N; j++)
      if (visit[j] && fa[j] == fa[i]) fa[j] = i;
  }
  clear_graph();
  for (int i = 2; i <= N; i++) addedge(i, fa[i], falen[i]), ans += falen[i];
}
void answer() {
  printf("%d\n", ans);
  solve(1);
  puts("");
}
void init() {
  scanf("%d%d", &N, &M);
  int a, b, w;
  for (int i = 1; i <= M; i++) {
    scanf("%d%d%d", &a, &b, &w);
    addedge(a, b, w);
  }
}
int main() {
  init();
  build_tree();
  answer();
}