#include<fstream>
#define dim 200004
#include<algorithm>
using namespace std;


ifstream f("lazy.in");
ofstream g("lazy.out");
int T[dim],x[dim],y[dim],I[dim],n,m;
long long pr[dim],cost[dim];
int tata(int x){
	int R;
	for ( R = x ; T[R] != R ; R = T[R] );
	int y;
	for ( ; T[x] != x ; ){
		y = T[x];
		T[x] = R;
		x = y;
	}
	return R;
}
inline bool cmp (int a,int b) {
	
	if(cost[a]==cost[b])
		return pr[a]>pr[b];
	else
		return cost[a]<cost[b];
	
}
int main () {
	
	f>>n>>m;
	int a,b ;
	for(int i=1;i<=m;i++){
		f>>x[i]>>y[i]>>cost[i]>>pr[i];
		T[i]=I[i]=i;
	}
	sort(I+1,I+1+m,cmp);
	
	for(int i=1;i<=m;i++){
		
		a=tata(x[I[i]]);
		b=tata(y[I[i]]);
		
		if(a!=b){
			T[a]=b;
			g<<I[i]<<"\n";
		}
		
		
	}
	return 0;
}