#include <bits/stdc++.h>

using namespace std;

ifstream f("cmcm.in");
ofstream g("cmcm.out");

priority_queue < pair < int , int > , vector < pair < int , int > > , greater < pair < int , int > > > h;
queue < int > q;
vector < pair < int , int > > v[610];
vector < int > sol;
int N,max_flow,cost_bell[610],inCoada[610],tata[610],cost_dijk[610],new_cost_bell[610],flux[610][610],C[610][610],cost[610][610];

void Bellman()
{
    for(int i=0;i<=N;i++)cost_bell[i]=INT_MAX/2;
    cost_bell[0]=0;q.push(0);inCoada[0]=1;

    while(!q.empty())
    {
        int nod=q.front();
        inCoada[nod]=0;
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            int vecin=v[nod][i].first;
            int cost_intre=cost[nod][vecin];
            if(flux[nod][vecin]<C[nod][vecin] && cost_bell[vecin]>cost_bell[nod]+cost_intre)
            {
                cost_bell[vecin]=cost_bell[nod]+cost_intre;
                if(inCoada[vecin]==0)inCoada[vecin]=1,q.push(vecin);
            }
        }
    }
}

int Dijkstra()
{
    for(int i=0;i<=N;i++)cost_dijk[i]=INT_MAX/2,new_cost_bell[i]=INT_MAX/2,tata[i]=-1;
    cost_dijk[0]=0;new_cost_bell[0]=0;h.push({0,0});

    while(!h.empty())
    {
        int nod=h.top().second;
        int cst=h.top().first;
        h.pop();

        if(cst==cost_dijk[nod])
        {
            for(int i=0;i<v[nod].size();i++)
            {
                int vecin=v[nod][i].first;
                int cost_intre=cost[nod][vecin]+cost_bell[nod]-cost_bell[vecin];
                if(flux[nod][vecin]<C[nod][vecin] && cost_dijk[vecin]>cost_dijk[nod]+cost_intre)
                {
                    cost_dijk[vecin]=cost_dijk[nod]+cost_intre;
                    h.push({cost_dijk[vecin],vecin});
                    new_cost_bell[vecin]=new_cost_bell[nod]+cost[nod][vecin];
                    tata[vecin]=nod;
                }
            }
        }
    }

    if(cost_dijk[N]==INT_MAX/2)return 0;

    max_flow+=new_cost_bell[N];
    int nod=N;
    while(tata[nod]!=-1)
    {
        flux[tata[nod]][nod]++;
        flux[nod][tata[nod]]--;
        nod=tata[nod];
    }

    for(int i=0;i<=N;i++)cost_bell[i]=new_cost_bell[i];
    return 1;
}

int n,m,e,i,j,x,y,c;
int main()
{
    f>>n>>m>>e;
    N=n+m+1;
    for(i=1;i<=e;i++)
    {
        f>>x>>y>>c;
        y+=n;
        cost[x][y]=c;cost[y][x]=-c;
        C[x][y]=1;
        v[x].push_back({y,i});
        v[y].push_back({x,i});
    }
    for(i=1;i<=n;i++)
    {
        v[0].push_back({i,0});
        v[i].push_back({0,0});
        C[0][i]=1;
    }
    for(i=n+1;i<N;i++)
    {
        v[i].push_back({N,0});
        v[N].push_back({i,0});
        C[i][N]=1;
    }

    Bellman();
    while(Dijkstra());

    for(i=1;i<=n;i++)
    for(j=n+1;j<N;j++)
    if(flux[i][j]==1)
    {
        for(int o=0;o<v[i].size();o++)
            if(v[i][o].first==j)sol.push_back(v[i][o].second),o=v[i].size();
    }

    g<<sol.size()<<" "<<max_flow<<'\n';
    for(i=0;i<sol.size();i++)g<<sol[i]<<" ";
    return 0;
}