#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>

#define NMAX 1007

using namespace std;

int n, m;
int q[NMAX];
vector <int> v[NMAX];
vector <int> Sol;
int dad[NMAX], Cap[NMAX][NMAX];
int a[NMAX], b[NMAX], c[NMAX], Viz1[NMAX], Viz2[NMAX];

void bfs(){
    int start = 0, avans = 0;
    q[avans++] = 1;
    while(start < avans && dad[n] == -1){
        int Nod = q[start++];
        for(int i = 0; i < v[Nod].size(); ++i)
            if(dad[v[Nod][i]] == -1 && Cap[Nod][v[Nod][i]] > 0){
                dad[v[Nod][i]] = Nod;
                q[avans++] = v[Nod][i];
            }
    }
}

int Flux(){
    int Maxflow = 0;
    while(1){
        memset(dad, -1, sizeof(dad));
        bfs();
        if(dad[n] == -1)
            break;
        for(int i = 1; i <= n; ++ i)
            if(Cap[i][n] && dad[i] != -1){
                int Min = Cap[i][n];
                for (int v = i, u = dad[v]; u > 0; v = u, u = dad[v])
                    Min = min(Min, Cap[u][v]);
                if(! Min)
                    continue;
                Maxflow += Min;
                Cap[i][n] -= Min;
                Cap[n][i] += Min;
                for (int v = i, u = dad[v]; u >= 0; v = u, u = dad[v]){
                    Cap[u][v] -= Min;
                    Cap[v][u] += Min;
                }
            }
    }
    return Maxflow;
}

int main(){
    freopen("critice.in", "r", stdin);
    freopen("critice.out", "w", stdout);
    scanf("%d %d\n", &n, &m);
    for(int i = 1; i <= m; ++i){
        scanf("%d %d %d\n", &a[i], &b[i], &c[i]);
        if(a[i] > b[i])
            swap(a[i], b[i]);
        v[a[i]].push_back(b[i]);
        v[b[i]].push_back(a[i]);
        Cap[a[i]][b[i]] = c[i];
    }
    int FluxNow = Flux();
    for(int j = 1; j <= m; ++j){
        memset(Cap, 0, sizeof(Cap));
        for(int i = 1; i <= m; ++i)
            Cap[a[i]][b[i]] = c[i];
        ++ Cap[a[j]][b[j]];
        int FluxCur = Flux();
        if(FluxNow < FluxCur){
            Sol.push_back(j);
            ++ c[j];
            FluxNow = FluxCur;
        }
    }
    printf("%d\n", Sol.size());
    for(int i = 0; i < Sol.size(); ++i)
        printf("%d\n", Sol[i]);
    return 0;
}