#include <fstream>
#include <algorithm>

#define mMax 200001
#define nMax 200001
using namespace std;
ifstream fin("lazy.in");
ofstream fout("lazy.out");
int n, m;
int Root[nMax];
struct muchii
{
    int x, y, poz;
    long long c1, c2;
}Edge[mMax];
int cmp(muchii a, muchii b)
{
    if(a.c1==b.c1)
        return a.c2>b.c2;
    return a.c1<b.c1;
}
void read()
{
    fin>>n>>m;

    for(int i=1;i<=m;i++)
    {
        fin>>Edge[i].x>>Edge[i].y>>Edge[i].c1>>Edge[i].c2;
        Edge[i].poz=i;
    }
}
inline int getRoot(int node)
{
    return ( Root[node]<0 ? node : Root[node]=getRoot(Root[node]) );
}
void solve()
{
    for(int i=1;i<=n;i++)
        Root[i]=-1;

    sort(Edge+1, Edge+m+1, cmp);

    for(int i=1;i<=m;i++)
    {
        int val1=getRoot(Edge[i].x);
        int val2=getRoot(Edge[i].y);
        if(val1!=val2)
        {
            fout<<Edge[i].poz<<'\n';

            switch(Root[val1]-Root[val2]<=0)
            {
                case 1:Root[val1]+=Root[val2];Root[val2]=val1;break;
                case 0:Root[val2]+=Root[val1];Root[val1]=val2;break;
            }
        }
    }
}
int main()
{
    read();
    solve();
    return 0;
}