#include<bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define per(i, a, b) for(int i = (a); i >= (b); --i)
#define pii pair<int, int>
#define fi first 
#define se second 
#define mkp make_pair

const int maxn = 2e5 + 5;

int n, m;
int cnt = 1, hd[maxn];
struct edge{
    int to, nxt, w;
}e[maxn << 1];

inline void add(int u, int v, int w){
    ++cnt; e[cnt] = {v, hd[u], w}; hd[u] = cnt;
}
inline void Add(int u, int v, int w){
    add(u, v, w), add(v, u, 0);
}

bool g[maxn << 1], vis[maxn << 1];
int low[maxn], dfn[maxn], tot, col[maxn], cc, st[maxn], tp;

inline void tarjan(int x, int lst){
    dfn[x] = low[x] = ++tot; st[++tp] = x;
    for(int i = hd[x]; i; i = e[i].nxt){
        if((i ^ 1) == lst) continue;
        int v = e[i].to;
        if(!dfn[v]){
            tarjan(v, i); low[x] = min(low[x], low[v]);
            if(low[v] > dfn[x]) g[i] = g[i ^ 1] = 1;
        } else low[x] = min(low[x], dfn[v]);
    }
}

int mn, mx; pii ix, in, Ix, In;

inline void dfs(int x){
    col[x] = cc;
    for(int i = hd[x]; i; i = e[i].nxt) if(!g[i]){
        if(mn >= e[i].w) mn = e[i].w, in = mkp(x, i);
        if(mx < e[i].w) mx = e[i].w, ix = mkp(x, i);
        if(col[e[i].to]) continue;
        dfs(e[i].to);
    }
}

vector<int> Ans;
vector<pii> T[maxn];

inline void Euler(int x){
    // cout << "Euler " << x << '\n';
    while(T[x].size()){
        pii ed = T[x].back(); T[x].pop_back();
        if(vis[ed.se]) continue; vis[ed.se] = 1;
        Euler(ed.fi);
    }
    Ans.push_back(x);
}

struct Max_Flow{
    
    int s, t, cur[maxn];

    inline void init(){
        vis[In.se] = vis[In.se ^ 1] = vis[Ix.se] = vis[Ix.se ^ 1] = 1;
        rep(u, 1, n) for(int i = hd[u]; i; i = e[i].nxt){
            if(vis[i]) continue;
            e[i].w = 1;
        }
        s = n + 1, t = s + 1;
        Add(s, In.fi, 1), Add(s, e[In.se].to, 1);
        Add(Ix.fi, t, 1), Add(e[Ix.se].to, t, 1);
    }

    int inq[maxn];
    inline int Dfs(int x){
        if(x == t) return 1;
        if(inq[x]) return 0; inq[x] = 1;
        for(int i = hd[x]; i; i = e[i].nxt){
            if(vis[i] or !e[i].w) continue;
            int v = e[i].to; 
            if(Dfs(v)){
                e[i].w -= 1, e[i ^ 1].w += 1; 
                inq[x] = 0; return 1;
            }
        }
        inq[x] = 0;
        return 0;
    }
    inline void calc(){
        Dfs(s); Dfs(s);
        // memset(vis, 0, sizeof vis);
        rep(u, 1, n + 2) for(int i = hd[u]; i; i = e[i].nxt){
            if(vis[i] or e[i].w) continue;
            int v = e[i].to;
            T[u].push_back(mkp(v, i));
            T[v].push_back(mkp(u, i));
            // printf("addT(%d,%d)\n", u, v);
        }
        Euler(s);
    }
}D;

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(NULL);

    cin >> n >> m;
    rep(i, 1, m){
        int u, v, w; cin >> u >> v >> w;
        add(u, v, w), add(v, u, w);
    }

    rep(i, 1, n) if(!dfn[i]) tarjan(i, 0);
    int ans = 0; 
    rep(i, 1, n) if(!col[i]){
        mn = 2e9, mx = -2e9;
        ++cc, dfs(i);
        if(mn < 2e9 and mx - mn >= ans){
            ans = mx - mn;
            Ix = ix, In = in;
        }
    } 

    cout << ans << '\n';
    // return 0;

    D.init(); D.calc();

    vector<int> Tmp; for(int x : Ans) if(x <= n) Tmp.push_back(x);
    cout << Tmp.size() << '\n';
    for(int x : Tmp) cout << x << " "; cout << '\n';
    return 0;
}