#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <map>#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)<(y)?(x):(y))
#define abs(x) ((x)>=0?(x):-(x))
#define i64 long long
#define u32 unsigned int
#define u64 unsigned long long
#define clr(x,y) memset(x,y,sizeof(x))
#define CLR(x) x.clear()
#define ph(x) push(x)
#define pb(x) push_back(x)
#define Len(x) x.length()
#define SZ(x) x.size()
#define PI acos(-1.0)
#define sqr(x) ((x)*(x))#define FOR0(i,x) for(i=0;i<x;i++)
#define FOR1(i,x) for(i=1;i<=x;i++)
#define FOR(i,a,b) for(i=a;i<=b;i++)
#define DOW0(i,x) for(i=x;i>=0;i--)
#define DOW1(i,x) for(i=x;i>=1;i--)
#define DOW(i,a,b) for(i=a;i>=b;i--)
using namespace std;void RD(int &x){scanf("%d",&x);}
void RD(i64 &x){scanf("%I64d",&x);}
void RD(u32 &x){scanf("%u",&x);}
void RD(double &x){scanf("%lf",&x);}
void RD(int &x,int &y){scanf("%d%d",&x,&y);}
void RD(i64 &x,i64 &y){scanf("%I64d%I64d",&x,&y);}
void RD(u32 &x,u32 &y){scanf("%u%u",&x,&y);}
void RD(double &x,double &y){scanf("%lf%lf",&x,&y);}
void RD(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
void RD(i64 &x,i64 &y,i64 &z){scanf("%I64d%I64d%I64d",&x,&y,&z);}
void RD(u32 &x,u32 &y,u32 &z){scanf("%u%u%u",&x,&y,&z);}
void RD(double &x,double &y,double &z){scanf("%lf%lf%lf",&x,&y,&z);}
void RD(char &x){x=getchar();}
void RD(char *s){scanf("%s",s);}
void RD(string &s){cin>>s;}void PR(int x) {printf("%d\n",x);}
void PR(i64 x) {printf("%I64d\n",x);}
void PR(u32 x) {printf("%u\n",x);}
void PR(u64 x) {printf("%llu\n",x);}
void PR(double x) {printf("%.4lf\n",x);}
void PR(char x) {printf("%c\n",x);}
void PR(char *x) {printf("%s\n",x);}
void PR(string x) {cout<<x<<endl;}const int INF=100000000;
const int N=105;
int g[N][N],fx[N],fy[N],match[N],Lx[N],Ly[N];
int n,m,p[N],d[N],sum;
vector<vector<int> > ans;
stack<int> st;int find(int u)
{fx[u]=1;int v;for(v=1;v<=n;v++) if(!fy[v]&&g[u][v]==Lx[u]+Ly[v]){fy[v]=1;if(match[v]==-1||find(match[v])){match[v]=u;return 1;}}return 0;
}void DFS(int u,vector<int> &path)
{int v;for(v=1;v<=n;v++){if(p[u]!=v&&g[u][v]>0&&--d[v]==0){st.push(v);}}d[u]=-1;path.pb(u);if(g[u][p[u]]==0) return;sum+=INF-g[u][p[u]];DFS(p[u],path);
}int main()
{RD(n,m);int i,j,u,v,c;FOR1(i,m){RD(u,v,c);g[u][v]=INF-c;Lx[u]=max(Lx[u],g[u][v]);d[v]++;}clr(match,-1);FOR1(u,n){while(1){clr(fx,0);clr(fy,0);if(find(u)) break;c=INF;FOR1(i,n) if(fx[i]) FOR1(j,n) if(!fy[j]){c=min(c,Lx[i]+Ly[j]-g[i][j]);}FOR1(i,n){if(fx[i]) Lx[i]-=c;if(fy[i]) Ly[i]+=c;}}}FOR1(i,n) p[match[i]]=i;FOR1(i,n) if(!d[i]) st.push(i);vector<int> path;while(!st.empty()){u=st.top();st.pop();path.clear();DFS(u,path);ans.pb(path);}printf("%d %d\n",SZ(ans),sum);FOR0(i,SZ(ans)){printf("%d",SZ(ans[i]));FOR0(j,SZ(ans[i])) printf(" %d",ans[i][j]);puts("");}return 0;
}