#include <stdio.h>
#include <vector>
#include <queue>
#include <string.h>
#include <climits>
using namespace std;
int n,m,e,i,x,y,z,nr,c[605][605],dn[605],dv[605],d[605],p[605],mc[305][305],cuplaj,cost,r,t[605];
const int inf=INT_MAX-1;
bool o[605];
vector<pair<int,int> > G[605];
queue<int> Q;
priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > H;
void bellmanford()
{
    int i,z,y;
    for (i=0;i<=nr;i++) dv[i]=inf;
    dv[0]=0; Q.push(0); o[0]=1;
    while (!Q.empty())
    {
        x=Q.front();
        Q.pop();
        o[x]=0;
        z=G[x].size();
        for (i=0;i<z;i++)
        {
            y=G[x][i].first;
            if (c[x][y]&&dv[y]>dv[x]+G[x][i].second)
            {
                dv[y]=dv[x]+G[x][i].second;
                if (!o[y]) o[y]=1,Q.push(y);
            }
        }
    }
}
bool dijkstra()
{
    int i,z,x,D;
    pair<int,int> p;
    for (i=0;i<=nr;i++) d[i]=inf;
    d[0]=0; H.push(make_pair(0,0));
    while (!H.empty())
    {
        p=H.top(); H.pop();
        x=p.second;
        if (d[x]!=p.first) continue;
        z=G[x].size();
        for (i=0;i<z;i++)
        {
            y=G[x][i].first;
            if (c[x][y])
            {
                D=d[x]+G[x][i].second+dv[x]-dv[y];
                if (d[y]>D)
                {
                    d[y]=D;t[y]=x;
                    dn[y]=dn[x]+G[x][i].second;
                    H.push(make_pair(d[y],y));
                }
            }
        }
    }
    memcpy(dv,dn,sizeof(dn));
    return d[nr]!=inf;
}
int main()
{
    freopen ("cmcm.in","r",stdin);
    freopen ("cmcm.out","w",stdout);
    scanf("%i%i%i",&n,&m,&e);
    for (i=1;i<=e;i++)
    {
        scanf("%i%i%i",&x,&y,&z);
        G[x].push_back(make_pair(y+n,z));
        G[y+n].push_back(make_pair(x,-z));
        mc[x][y]=i;
        c[x][y+n]=1;
    }
    nr=n+m+1;
    for (i=1;i<=n;i++)
    {
        G[0].push_back(make_pair(i,0));
        G[i].push_back(make_pair(0,0));
        c[0][i]=1;
    }
    for (i=1;i<=m;i++)
    {
        G[i+n].push_back(make_pair(nr,0));
        G[nr].push_back(make_pair(i+n,0));
        c[i+n][nr]=1;
    }
    bellmanford();
    while (dijkstra())
    {
        cuplaj++;
        r=inf;
        for (i=nr;i;i=t[i]) r=min(r,c[t[i]][i]);
        cost+=r*dn[nr];
        for (i=nr;i;i=t[i])
        {
            p[t[i]]=i;
            c[t[i]][i]-=r;
            c[i][t[i]]+=r;
        }
    }
    printf("%i %i\n",cuplaj,cost);
    for (i=1;i<=n;i++)
        if (p[i]) printf("%i ",mc[i][p[i]-n]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}