using namespace std;
#include<iostream>
#include<fstream>
#include<vector>

#define nmax 200010
#define pb push_back
#define oo 0x3f3f3f3f
struct edge{
    long long x,y;
    long long c,p;
    int ind;
};
edge a[nmax];
int T[nmax],r[nmax];
vector<int> ans;
int N,M;
ofstream fout("lazy.out");

void init()
{
    int i;
    for(i=1;i<=N;i++)
    {
        T[i]=i;
        r[i]=1;
    }
}

int find(int x)
{
    int R,y;
    for(R=x;R!=T[R];R=T[R]);
    for(;x!=T[x];)
    {
        y=T[x];
        T[x]=R;
        x=y;
    }
    return R;
}

void unite(int x,int y)
{
    if(r[x]>r[y])
    {
        T[y]=x;

    }
    else
    {
        T[x]=y;
    }
    if(r[x]==r[y]) r[y]++;
}

void solve()
{
    int i;
    for(i=1;i<=M;i++)
    {
        if(find(a[i].x)!=find(a[i].y))
        {
            unite(find(a[i].x),find(a[i].y));
            ans.pb(a[i].ind);
        }
    }
    vector<int>::iterator it;
    for(it=ans.begin();it<ans.end();it++)
    {
        fout<<*it<<"\n";
    }
}

bool cmp(edge i,edge j)
{
     if(i.c<j.c)
        return 1;
        else if(i.c==j.c && i.p>=j.p)   //antentie
            return 1;
     return 0;
}

void cit()
{
    ifstream fin("lazy.in");
    int i,j,x,y;
    long long c1,c2;
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>a[i].x>>a[i].y>>c1>>c2;
        a[i].c=c1;
        a[i].p=c2;
        a[i].ind=i;
    }


    fin.close();

}


int main()
{
    cit();
    sort(a+1,a+M+1,cmp);
    init();
    solve();
    fout.close();
    return 0;
}