#include<bits/stdc++.h>
#define maxN 1005
using namespace std;
int n,m,f[maxN][maxN],c[maxN][maxN],tt[maxN],x,y,z,Source,sol=INT_MAX,best;
bool seen[maxN];
vector<int> v[maxN];
vector<int> muchii[maxN];
deque<int> q;
vector<int> Cuts,solutie;
void FindCuts()
{
    for(int i=1;i<=n;i++)
        seen[i]=0;
    seen[1]=1;
    q.push_back(1);
    while(!q.empty())
    {
        int nod=q.front();
        for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
        {
            //int ind=it-v[nod].begin();
            if(!seen[*it] && c[nod][*it]!=abs(f[nod][*it]))
            {
                q.push_back(*it);
                seen[*it]=1;
            }
        }
        q.pop_front();
    }
    for(int i=1;i<=n;i++)
    {
        if(!seen[i]) continue;
        for(vector<int>::iterator it=v[i].begin();it!=v[i].end();it++)
        {
            int ind=it-v[i].begin();
            if(!seen[*it])
            {
             //   ind=
                Cuts.push_back(muchii[i][ind]);
            }
        }
    }
}
bool bfs(int Source,int Destination)
{
    for(int i=1;i<=n;i++)
        seen[i]=0;
    q.push_back(Source);
    seen[Source]=1;
    while(!q.empty())
    {
        int nod=q.front();
        for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
        {
            if(!seen[*it] && c[nod][*it]>f[nod][*it])
            {
                tt[*it]=nod;
                seen[*it]=1;
                q.push_back(*it);
            }
        }
        q.pop_front();
    }
    return seen[Destination];
}
int GetMaxFlow(int Source,int Destination)
{
    /**
        Clearing the Flow Matrix
    */
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            f[i][j]=0;
    int flow=0;
    int sol=0;
    while(bfs(Source,Destination))
    {
        for(vector<int>::iterator it=v[Destination].begin();it!=v[Destination].end();it++)
        {
            flow=c[*it][Destination]-f[*it][Destination];
            for(int t=*it;t>Source;t=tt[t])
            {
                flow=min(flow,c[tt[t]][t]-f[tt[t]][t]);
            }
            f[*it][Destination]+=flow;
            f[Destination][*it]-=flow;
            for(int t=*it;t>Source;t=tt[t])
            {
                f[tt[t]][t]+=flow;
                f[t][tt[t]]-=flow;
            }
            sol+=flow;
        }
    }
    return sol;
}
int main()
{
    freopen("critice.in","r",stdin);
    freopen("critice.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        c[x][y]=max(c[x][y],z);
        c[y][x]=max(c[y][x],z);
        v[x].push_back(y);
        muchii[x].push_back(i);
        v[y].push_back(x);
        muchii[y].push_back(i);
    }
    Source=1;
    for(int Destination=2;Destination<=n;Destination++)
    {
        int flow=GetMaxFlow(Source,Destination);
        if(flow<=sol)
        {
            sol=flow;
            best=Destination;
        }
    }
    //printf("%d ",sol);
    GetMaxFlow(1,best);
    FindCuts();
    sort(Cuts.begin(),Cuts.end());
    printf("%d\n",Cuts.size());
    for(vector<int>::iterator it=Cuts.begin();it!=Cuts.end();it++)
        printf("%d\n",*it);
    //printf("%d %d\n",f[9][10],c[9][10]);
    return 0;
}