//Vasilut
#include<fstream>
#include<algorithm>

#define NN 200001
using namespace std;
ofstream out("lazy.out");

struct drumusor{
    int x,y,nr;
    long long c1,c2;
    };
    drumusor v[NN];

int T[NN],n,m,H[NN],k;

bool cmp(drumusor i,drumusor j)
{
    return i.c1 < j.c1 || ( i.c1 == j.c1  && i.c2 > j.c2 ) ;
}

int cauta(int );
void unire(int ,int );
void read();
void kruskal();


int main()
{
    read();
    kruskal();
    return 0;
}

void read()
{
    ifstream in("lazy.in");
    in>>n>>m;
    int k=0;
    for(int x,y,i=1;i<=m;i++)
    {

    if(i<=n)
    T[i]=i;
        long long c1,c2;
        in>>x>>y>>c1>>c2;
        v[i].x=x;
        v[i].y=y;
        v[i].c1=c1;
        v[i].c2=c2;
        v[i].nr=i;
    }
}


int cauta(int nod)
{
    if( nod !=T[nod] )
    T[nod]=cauta(T[nod]);
        return T[nod];
}

void unire(int nod1,int nod2)
{
   if (H[nod1] > H[nod2] )
    T[nod2]=nod1;
    else
    {
        T[nod1]=nod2;
        if( H[nod1] == H[nod2] )
        H[nod2]++;
    }
}

void kruskal()
{


    sort(v+1,v+m+1,cmp);
    for(int i=1;i<=m;i++)
    {
        if( cauta(v[i].x ) != cauta(v[i].y) )
        {
            ++k;
            out<<v[i].nr<<" "<<'\n';
            unire(v[i].x,v[i].y);
        }
        if ( k == n-1 )
            return ;
    }
}