#include<fstream>

#define dim 200007
#include<algorithm>
using namespace std;


ifstream f("lazy.in");
ofstream g("lazy.out");
int T[dim],x[dim],y[dim],I[dim],n,m,pr[dim],cost[dim],s[dim],a,b,k,i;
int tata(int x){
	
	while(x!=T[x])
		x=tata(T[x]);
	return T[x];
	
}
int 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;
	
	for(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(i=1;i<=n;i++){
		
		a=tata(x[I[i]]);
		b=tata(y[I[i]]);
		
		if(a!=b){
			T[a]=b;
			s[++k]=I[i];
		}
		
		
	}
	for(i=1;i<=k;i++)
		g<<s[i]<<"\n";
	return 0;
}