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

using namespace std;

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

const int NMAX=2e5+5;
int t[NMAX];
int p[NMAX];

struct elem{
    int x;
    int y;
    long long c1;
    long long c2;
    int ind;
}apm[NMAX];

bool cmp(int a,int b)
{
    if(apm[a].c1==apm[b].c1)
        return apm[a].c2<apm[b].c2;
    return apm[a].c1<apm[b].c1;
}

int root(int x)
{
    if(t[x]==x)
        return x;
    return t[x]=root(t[x]);
}

void solve(int x,int y)
{
    t[root(y)]=root(x);
}

int main()
{
    int n,m,i,j,s=0;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        t[i]=i;
    for(i=1;i<=m;i++)
    {
        fin>>apm[i].x>>apm[i].y>>apm[i].c1>>apm[i].c2;
        apm[i].ind=i;
        p[i]=i;
    }
    sort(p+1,p+m+1,cmp);
    for(i=1;i<=m;i++)
    {
        if(root(apm[p[i]].x)!=root(apm[p[i]].y))
        {
            solve(root(apm[p[i]].x),root(apm[p[i]].y));
            fout<<apm[p[i]].ind<<"\n";
        }
    }
    return 0;
}