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

#define Nmax 205
#define Emax 5000
#define INF 0x3f3f3f3f

using namespace std;

int N,M,S,D;
vector<int> G[Nmax],sol;
bitset<Nmax> used;
int flow[Nmax][Nmax],capacity[Nmax][Nmax],ap[Nmax],ind[Nmax][Nmax],daddy[Nmax];
pair<int,int> edge[Emax];
queue<int> Q;

void Read()
{
    scanf("%d%d",&N,&M);
    int a,b,c;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%d%d%d",&a,&b,&c);
        capacity[a][b] = capacity[b][a] = c;
        G[a].push_back(b);
        G[b].push_back(a);
        edge[i] = make_pair(a,b);
        ind[a][b] = ind[b][a] = i;
    }
}

bool BFS(int k)
{
    used = 0;
    used[k] = 1;
    Q.push(k);
    while(!Q.empty())
    {
        k = Q.front(); Q.pop();
        if(k == D) continue;
        for(vector<int>::iterator it = G[k].begin(); it != G[k].end(); ++it)
            if(!used[*it] && capacity[k][*it] != flow[k][*it])
            {
                int v = *it;
                used[*it] = 1;
                daddy[*it] = k;
                Q.push(*it);
            }
    }
    return used[D];
}

int FLOW(int k)
{
    int minFLOW,maxFLOW = 0;
    while(BFS(k))
    for(vector<int>::iterator it = G[D].begin(); it != G[D].end(); ++it)
    {
        if(capacity[*it][D] == flow[*it][D] || !used[*it])
            continue;
        daddy[D] = *it;
        minFLOW = INF;
        for(int nodc = D; nodc != S; nodc = daddy[nodc])
            minFLOW = min(minFLOW,capacity[daddy[nodc]][nodc] - flow[daddy[nodc]][nodc]);
        for(int nodc = D; nodc != S; nodc = daddy[nodc])
        {
            flow[daddy[nodc]][nodc] += minFLOW;
            flow[nodc][daddy[nodc]] -= minFLOW;
        }
        maxFLOW += minFLOW;
    }
    return maxFLOW;
}

void DFS(int k)
{
    used[k] = 1;
    for(vector<int>::iterator it = G[k].begin(); it != G[k].end(); ++it)
        if(!used[*it] && capacity[k][*it] != flow[k][*it])
            DFS(*it);
}

void Solve()
{
    S = 1;
    int mini = INF, crt;
    for(int i = 2; i <= N; ++i)
    {
        D = i;
        crt = FLOW(S);
        if(crt < mini)
        {
            sol.clear();
            mini = crt;
            used = 0;
            DFS(S);
            for(int i = 1; i <= M; ++i)
                if(used[edge[i].first] != used[edge[i].second])
                    sol.push_back(ind[edge[i].first][edge[i].second]);
        }
        memset(flow,0,sizeof(flow));
    }
    printf("%d %d\n",mini,sol.size());
    for(int i = 0; i < (int)sol.size(); ++i)
        printf("%d\n",sol[i]);
}

int main()
{
    freopen("sabotaj.in","r",stdin);
    freopen("sabotaj.out","w",stdout);

    Read();
    Solve();

    return 0;
}