#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int c[1014][1014],viz1[1014],viz2[1014],n,m,prec[1014],flux[1014][1014],apar[1014];
vector <int> v[1014];
vector <pair <int, int> > muchie;
queue <int> q;
int bfs()
{
    int i,nod,nodc;
    for(i=1;i<=n;i++)
        prec[i]=0;
    prec[1]=1;
    q.push(s);
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(i=0;i<v[nod].size();i++)
        {
            nodc=v[nod][i];
            if (prec[nodc]==0)
                if (flux[nod][nodc]>c[nod][nodc])
                {
                    prec[nodc]=nod;
                    if (nodc!=n)
                        q.push(nodc);
                }
        }
    }
    if(prec[n])
        return 1;
    return 0;
}
struct cmp
{
    bool operator () (int a, int b)
    {
        return a>b;
    }
};
inline int saturare (int n1, int n2)
{
    if (c[n1][n2]==flux[n1][n2])
        return 1;
    if (c[n2][n1]==flux[n2][n1])
        return 1;
    return 0;
}
void bfs2( int nod, int viz[])
{
    int i;
    viz[nod]=1;
    for (i=0;i<v[nod].size();i++)
        if (viz[v[nod][i]]==0 && saturare(nod,v[nod][i])==0 && c[nod][v[nod][i]]>flux[nod][v[nod][i]])
            bfs2(v[nod][i], viz);

}
inline int conditie (int n1, int n2)
{
    if (viz1[n1]==1 && viz2[n2]==1)
        return 1;
    if (viz1[n2]==1 && viz2[n1]==1)
        return 1;
    return 0;
}
int main()
{
    int m,i,x,y,z,fmin,vf,nod1,nod2;
    fstream f,g;
    f.open("critice.in",ios::in);
    g.open("critice.out",ios::out);
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        c[x][y]+=z;
        c[y][x]+=z;
        v[x].push_back(y);
        v[y].push_back(x);
        muchie.push_back(make_pair(x,y));
    }
    while(bfs())
    {
        for(i=0;i<v[n].size();i++)
            if( flux[v[n][i]][n]>c[v[n][i]][n] && (prec[v[n][i]]))
            {
                vf=v[n][i];
                prec[n]=vf;
                fmin=c[vf][n]-flux[vf][n];
                while(vf!=1)
                {
                    fmin=min(fmin,c[prec[vf]][vf]-flux[prec[vf]][vf]);
                    vf=prec[vf];
                }
                if(fmin>0)
                {
                    vf=n;
                    while(vf!=1)
                    {
                        flux[prec[vf]][vf]+=fmin;
                        flux[vf][prec[vf]]-=fmin;
                        vf=prec[vf];
                    }
                }
            }
    }
    bfs2(1, viz1);
    bfs2(n, viz2);
    priority_queue<int, vector<int>, cmp > heap;// fara functia cmp mi-l face in ord descrescatoare
    for (i=0;i<muchie.size();i++)
    {
        nod1=muchie[i].first;
        nod2=muchie[i].second;
        if (saturare(nod1,nod2) && conditie(nod1, nod2))
            heap.push(i+1);
    }
    g<<heap.size()<<"\n";
    while (!heap.empty())
    {
        g<<heap.top()<<'\n';
        heap.pop();
    }
}