#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
#define pii pair<int,int>
#define Lson L, mid, rt<<1
#define Rson mid+1, R, rt<<1|1
const int maxn=5e2+10;
using namespace std;
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}
int n,m,k,t,h[maxn],tot,vis[maxn],s,cur[maxn];
bool flag;
set<int>ans;
struct node
{
int to,nxt,cap,flow;
}e[20000<<1];
void add(int x,int y,int z)
{
e[tot].to=y;
e[tot].nxt=h[x];
e[tot].cap=z;
h[x]=tot++;
e[tot].to=x;
e[tot].nxt=h[y];
h[y]=tot++;
}
bool bfs()
{
memset(vis,0,sizeof vis);
queue<int>p;
p.push(s);
vis[s]=1;
if(flag)ans.insert(s);
while(!p.empty())
{
int x=p.front();p.pop();
for(int i=h[x];i!=-1;i=e[i].nxt)
{
int to=e[i].to,cap=e[i].cap,flow=e[i].flow;
if(!vis[to]&&cap>flow)
{
vis[to]=vis[x]+1;
p.push(to);
if(flag)ans.insert(to);
}
}
}
return vis[t];
}
int dfs(int x,int a)
{
if(x==t||a==0)return a;
int ans=0,j;
for(int&i=cur[x];i!=-1;i=e[i].nxt)
{
int to=e[i].to,cap=e[i].cap,flow=e[i].flow;
if(vis[to]==vis[x]+1&&(j=dfs(to,min(a,cap-flow)))>0)
{
e[i].flow+=j;
e[i^1].flow-=j;
ans+=j;
a-=j;
if(a==0)break;
}
}
return ans;
}
int max_flow(int s,int t)
{
int flow=0,i;
while(bfs())
{
rep(i,1,n)cur[i]=h[i];
flow+=dfs(s,inf);
}
return flow;
}
int main()
{
int i,j;
memset(h,-1,sizeof h);
scanf("%d%d",&n,&m);
while(m--)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);
}
s=1,t=n;
printf("%d",max_flow(s,t));
flag=true;
bfs();
printf(" %d\n",ans.size());
for(int x:ans)printf("%d ",x);
printf("\n");
//system("Pause");
return 0;
}