#include <stdio.h>
#include <vector>
#include <queue>
#define Nmax 1005
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define INF 2147000000
using namespace std;

vector< int > G[Nmax],v;
vector< int >:: iterator it;
queue< int > Q;
pair< int,int > M[Nmax];
int C[Nmax][Nmax],F[Nmax][Nmax];
int viz[2][Nmax],prev[Nmax];
int i,x,y,z,n,m,nr,wh;
int fmin,fmax;

inline int Minim(int x,int y){ return x<y ? x:y; }

int BF(int s,int st){
	int x;
	memset(viz[st],0,sizeof(viz[st]));
	Q.push(s); viz[st][s]=1;
	
	while( ! Q.empty() ){
		x=Q.front();
		for(it=G[x].begin(); it!=G[x].end(); ++it)
			if(!viz[st][*it] && F[x][*it] < C[x][*it]){
				viz[st][*it]=1;
				Q.push(*it);
				prev[*it]=x;
			}
		Q.pop();
	}
	return viz[st][n];
}


int main(){
	freopen("critice.in","r",stdin);
	freopen("critice.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;++i){
		scanf("%d%d%d",&x,&y,&z);
		C[x][y]=C[y][x]=z;
		M[i]=mp(x,y);
		G[x].pb(y);
		G[y].pb(x);
	}
	
	while( BF(1,0) )
		for(it=G[n].begin(); it!=G[n].end(); ++it)
		if( viz[*it] ){
			
			fmin=INF; prev[wh]=*it;
			for(wh=n; wh!=1 && fmin; wh=prev[wh])
				fmin=Minim(fmin,C[prev[wh]][wh]-F[prev[wh]][wh]);
			if( fmin==0 ) continue;
			
			for(wh=n; wh!=1; wh=prev[wh]){
				F[prev[wh]][wh] += fmin;
				F[wh][prev[wh]] -= fmin;
			}
			
			fmax += fmin;
		}
	
	BF(1,0);
	BF(n,1);
	
	for(i=1;i<=m;++i)
		if( F[M[i].x][M[i].y] == C[M[i].x][M[i].y] &&
			viz[0][M[i].x] && viz[1][M[i].y] ) ++nr,v.pb(i); 
		else
		if( F[M[i].y][M[i].x] == C[M[i].x][M[i].y] &&
			viz[0][M[i].y] && viz[1][M[i].x] ) ++nr,v.pb(i); 
		
	printf("%d\n",nr);
	for(it=v.begin(); it!=v.end(); ++it) printf("%d\n",*it);
	fclose(stdin); fclose(stdout);
	return 0;
}