#include<bits/stdc++.h>
using namespace std;
ifstream F("cmcm.in");
ofstream G("cmcm.out");
int n,m,t,i,j,k,e[602][602],f[602][602],l,a[50001],b[50001],c[50001],r,p[602],w,d[602],v,h[602][602];
vector<int> g[602];
queue<int> q;
bool z[50001],u[602],y[602][602];
int main()
{
    for(F>>n>>m>>t,i=1;i<=t;F>>a[i]>>b[i]>>c[i],g[a[i]].push_back(b[i]+n),g[b[i]+n].push_back(a[i]),h[a[i]][b[i]+n]=c[i],h[b[i]+n][a[i]]=-c[i],e[a[i]][b[i]+n]=1,++i);
    for(i=1;i<=n;g[0].push_back(i),g[i].push_back(0),e[0][i++]=1);
    for(i=n+1;i<=n+m;g[i].push_back(n+m+1),g[n+m+1].push_back(i),e[i++][n+m+1]=1);
    for(;;) {
        for(i=1;i<n+m+2;d[i++]=2e9);
        for(q.push(0),d[0]=0,u[0]=1;!q.empty();u[i]=0,q.pop())
            for(i=q.front(),k=g[i].size(),j=0;j<k;++j)
                if(e[i][g[i][j]]>f[i][g[i][j]]&&d[g[i][j]]>d[i]+h[i][g[i][j]])
                    if(d[g[i][j]]=d[i]+h[i][g[i][j]],p[g[i][j]]=i,!u[g[i][j]])
                        u[g[i][j]]=1,q.push(g[i][j]);
        if(d[n+m+1]==2e9)
            break;
        for(r=2e9,i=n+m+1;i;r=min(r,e[p[i]][i]-f[p[i]][i]),i=p[i]);
        for(v+=d[n+m+1],++w,y[p[p[n+m+1]]][p[n+m+1]]=1,i=n+m+1;i;f[p[i]][i]+=r,f[i][p[i]]-=r,i=p[i]);
    }
    for(G<<w<<' '<<v<<'\n',i=1;i<=t;++i)
        if(y[a[i]][b[i]+n])
            G<<i<<' ';
    return 0;
}