using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((int)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (int (i)=0;(i)<(int)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)

#define IN "lazy.in"
#define OUT "lazy.out"
#define N_MAX (1<<18)

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

int N,M;
int T[N_MAX],Nr[N_MAX],Xi[N_MAX],Yi[N_MAX];
vector< pair< pair<ll,ll>,int> > Edges;

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	
	ll c,t;
	
	scanf("%d%d",&N,&M);
	FOR(i,1,M)
	{
		scanf("%d%d%lld%lld",&Xi[i],&Yi[i],&c,&t);
		Edges.pb( mp( mp(c,-t), i ) );
	}
}

II int rep(int nod)
{
	return T[nod] ? T[nod] = rep(T[nod]) : nod;
}

II void add(int x,int y)
{
	if(Nr[x] > Nr[y])
		Nr[x] += Nr[y],T[y] = x;
	else
		Nr[y] += Nr[x],T[x] = y;
}

II void solve()
{
	sort( all(Edges) );
	FOR(i,1,N) 
		Nr[i] = 1;
	
	FORit(it,Edges)
	{
		int x = Xi[it->s];
		int y = Yi[it->s];
		
		if( rep(x) != rep(y) )
		{
			add( rep(x), rep(y) );
			printf("%d\n",it->s);
		}
	}
}

int main()
{
	scan();
	solve();
	return 0;
}