[zoj2676]

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#define EPS 1e-9
#define INF 0x3f3f3f3f
#define MAX_V 5000
#define MAX_E 500
using namespace std;
struct edge{int from,to,rev;double cap;}es[MAX_E];
vector<edge> G[MAX_V];
queue<int> que;
int level[MAX_V],iter[MAX_V];
bool mark[MAX_V];
int N,M;
void init(){
	for(int i = 0;i < MAX_V;++i){
		G[i].clear();
	}
}
void add_edge(int from,int to,double cap){
	G[from].push_back((edge){from,to,G[to].size(),cap});
	G[to].push_back((edge){to,from,G[from].size() - 1,cap});
}
void Din_bfs(int s){
	memset(level,-1,sizeof(level));
	level[s] = 0;
	que.push(s);
	while(!que.empty()){
		int v = que.front();que.pop();
		for(int i = 0;i < G[v].size();++i){
			edge &e = G[v][i];
			if(e.cap > 0.0 && level[e.to] < 0){
				level[e.to] = level[v] + 1;
				que.push(e.to);
			}
		}
	}
}
double Din_dfs(int v,int t,double f){
	if(v == t)return f;
	for(int &i = iter[v];i < G[v].size();++i){
		edge &e = G[v][i];
		if(e.cap > 0 && level[v] < level[e.to]){
			double d = Din_dfs(e.to,t,min(e.cap,f));
			if(d > 0){
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}
double max_flow(int s,int t){
	double flow = 0.0;
	for(;;){
		Din_bfs(s);
		if(level[t] < 0)return flow;
		memset(iter,0,sizeof(iter));
		double f;
		while((f = Din_dfs(s,t,INF)) > 0){
			flow += f;
		}
	}
}
bool C(double rat){
	init();
	int flow = 0;
	for(int i = 0;i < M;++i){
		if(es[i].cap + EPS < rat){
			flow += es[i].cap - rat;
		}else{
			add_edge(es[i].from,es[i].to,es[i].cap - rat);
		}
	}
	flow += max_flow(1,N);
	return flow > EPS;
}
void dfs(int s){
	mark[s] = true;
	for(int i = 0;i < G[s].size();++i){
		edge e = G[s][i];
		if(e.cap > EPS && !mark[e.to]){
			dfs(e.to);
		}
	}
}
void solve(){
	double lb = 0.0,ub = 10000000.0,mid;	
	while(lb + EPS < ub){
		mid = (lb + ub) / 2;
		if(C(mid))lb = mid;
		else ub = mid;	
	}
	double rat = mid;
	memset(mark,false,sizeof(mark));
	dfs(1);
	int ans = 0;
	for(int i = 0;i < M;++i){
		if(es[i].cap + EPS < rat || (mark[es[i].from] + mark[es[i].to]) == 1){
			++ans;
		}
	}
	printf("%d\n",ans);
	bool first = true;
	for(int i = 0;i < M;++i){
		if(es[i].cap + EPS < rat || (mark[es[i].from] + mark[es[i].to]) == 1){
			if(first){
				printf("%d",i + 1);
				first = false;
			}else{
				printf(" %d",i + 1);
			}
		}
	}
	putchar('\n');
}
int main(){
	while(~scanf("%d%d",&N,&M)){
		for(int i = 0;i < M;++i){
			scanf("%d%d%lf",&es[i].from,&es[i].to,&es[i].cap);
		}
		solve();
	}
	return 0;
}