#include <bits/stdc++.h>
#define inf 99999999

using namespace std;

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

int n,m,graph[1005][1005], tata[1005];
vector <pair<int,int> > muchii;
vector <int> lista[1005];
deque <int> q;
bool bfs()
{
    memset(tata,0,sizeof(tata));
    q.push_back(1);
    tata[1]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop_front();
        for(auto x:lista[nod])
        {
            if(!tata[x] && graph[nod][x]>0)
            {
                tata[x]=nod;
                q.push_back(x);
            }
        }
    }
    return tata[n];
}
void max_flow()
{
    while(bfs())
    {
        for(auto x:lista[n])
        {
            if(graph[x][n]<=0) continue;
            int flow=graph[x][n];
            for(int u=x; u!=tata[u]; u=tata[u])
            {
                int v=tata[u];
                flow=min(flow,graph[v][u]);
            }
            graph[x][n]-=flow;
            graph[n][x]+=flow;
            for(int u=x; u!=tata[u]; u=tata[u])
            {
                int v=tata[u];
                graph[v][u]-=flow;
                graph[u][v]+=flow;
            }
        }
    }
}
int ap[1005];
void dfs(int node)
{
    ap[node]=1;
    for(auto x:lista[node])
        if(!ap[x] && graph[node][x]>0)
            dfs(x);
}
vector <int> sol;
int main()
{
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x,y,c;
        fin >> x >> y >> c;
        muchii.push_back({x,y});
        graph[x][y]=c;
        graph[y][x]=c;
        lista[x].push_back(y);
        lista[y].push_back(x);
    }
    max_flow();
    dfs(1);
    for(int i=1; i<=m; i++)
    {
        int u=muchii[i-1].first;
        int v=muchii[i-1].second;
        if((ap[u] && !ap[v]) || (ap[v] && !ap[u]))
        {
            sol.push_back(i);
        }
    }
    fout << sol.size() << '\n';
    for(auto x:sol)
    {
        fout << x << '\n';
    }
    return 0;
}