#include <cstdio>
#include <algorithm>
#include <cmath>
#define Nmax 200005
#define eps 0.00000000000001

using namespace std;

int n,sol[Nmax],t[Nmax];

inline int Find(int a)
{
    int rad,i=a;
    while(t[a]>0)
        a=t[a];
    rad=a;
    while(t[i]>0)
    {
        a=t[i];
        t[i]=rad;
        i=a;
    }
    return rad;
}

inline void Union(int a, int b)
{
    t[a]+=t[b];
    t[b]=a;
}

struct Edge
{
    int x,y,c1,c2,poz;
    bool operator <(const Edge &A) const
    {
        if(c1==A.c1) return (log((double)(c1))+log((double)c2)-log((double)A.c1)+log((double)A.c2)<eps);
        return c1<A.c1;
    }
} a[Nmax];

int main()
{
    int i,m,x,y;
    freopen ("lazy.in","r",stdin);
    freopen ("lazy.out","w",stdout);
    scanf("%d%d", &n,&m);
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d%d", &a[i].x,&a[i].y,&a[i].c1,&a[i].c2);
        a[i].poz=i;
    }
    sort(a+1,a+m+1);
    for(i=1;i<=n;++i) t[i]=-1;
    for(i=1;i<=m;++i)
    {
        x=Find(a[i].x); y=Find(a[i].y);
        if(x!=y)
        {
            sol[++sol[0]]=a[i].poz;
            Union(x,y);
        }
    }
    for(i=1;i<=sol[0];++i) printf("%d\n", sol[i]);
    return 0;
}