#include <iostream>
#include <fstream>
#include <algorithm>

#define maxN 200020
#define int64 long long

using namespace std;

ifstream fin("lazy.in");
ofstream fout("lazy.out");

struct edge
{
    int x,y,ind;
    int64 c1,c2;
}v[maxN];
int n,m,gr[maxN];

void readData()
{
    fin>>n>>m;
    for (int i=1; i<=m; ++i)
    {
        fin>>v[i].x>>v[i].y>>v[i].c1>>v[i].c2;
        v[i].ind=i;
    }
}

bool cmp(edge a, edge b)
{
    if (a.c1==b.c1) return a.c2>b.c2;
    return a.c1<b.c1;
}

int getGroup(int x)
{
    if (gr[x]==x) return x;
    gr[x]=getGroup(gr[x]);
    return gr[x];
}

void makeGroup(int x, int y)
{
    gr[getGroup(x)]=getGroup(y);
}

int main()
{
    readData();
    for (int i=1; i<=n; ++i)
        gr[i]=i;
    sort(v+1, v+m+1, cmp);
    for (int i=1; i<=m; ++i)
        if (getGroup(v[i].x)!=getGroup(v[i].y))
    {
        makeGroup(v[i].x,v[i].y);
        fout<<v[i].ind<<'\n';
    }
    return 0;
}