#include <cstdio>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
#define MAX 800
#define INF 0xfffffff

vector<int>g[MAX];
set<int>s1,s2;

int n,m,s,d,c[MAX][MAX],f[MAX][MAX],p[MAX][MAX],o[MAX][MAX],dist[MAX],tt[MAX];
bool was[MAX];

bool drum(){
    int x,y;
    for(int i=1;i<=d;i++)
    {
        dist[i] = INF;
        tt[i] = 0;
    }
        dist[s] = 0;

    s1.insert(s);
    for(int i=1;i<=d;i++)
    {
        while(s1.size() > 0)
        {
        x = *s1.begin(); s1.erase(s1.begin());
        for(int i=0;i<g[x].size();i++)
        {
            y = g[x][i];
            if( dist[y] > dist[x] + p[x][y] && c[x][y] > f[x][y] )
            {
                dist[y] = dist[x] + p[x][y];
                tt[y] = x;
                s2.insert(y);
            }
        }
        }
        swap(s1,s2);
    }
  //  for(int i=1;i<=n;i++)printf("%d ",dist[i]);
   // printf("\n");
   if( dist[d] != INF )return 1; else return 0;
}
/*
bool drum(){
    int y;
    for(int i=1;i<=n;i++)
    {
        dist[i] = INF;
        tt[i] = 0;
    }
        dist[s] = 0;

    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        for(int j=0;j<g[i].size();j++)
        {
            y = g[i][j];
            if( dist[y] > dist[i] + p[i][y] && c[i][y] > f[i][y] )
            {
                dist[y] = dist[i] + p[i][y];
                tt[y] = i;
            }
        }
    }
  //  for(int i=1;i<=n;i++)printf("%d ",dist[i]);
   // printf("\n");
    if( dist[d] < INF/2 )return 1; else return 0;
}
*/
void cuplaj(){
    int fmcm = 0, flux;

    int step = 0;
    while( drum() )
    {
        flux = INF;
        for(int x = d; x != s;x = tt[x]) flux = min(flux, c[tt[x]][x]-f[tt[x]][x]);
        for(int x = d; x != s;x = tt[x])
            {
                f[tt[x]][x] += flux;
                f[x][tt[x]] -= flux;
                fmcm += flux * p[tt[x]][x];
            }
       // for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++) printf("%d ",f[i][j]); printf("\n"); }
    }
    int nr = 0;
    for(int i=1;i<=d;i++)
    for(int j=1;j<=d;j++) if( f[i][j] > 0 )nr++;
    printf("%d %d\n",nr/3,fmcm);
    for(int i=1;i<=d;i++)
    for(int j=1;j<=d;j++) if( f[i][j] > 0 && i!= s && j != d) printf("%d ",o[i][j]);
}

int main(){
    int x,y,z,e;
    freopen("cmcm.in","r",stdin);
    freopen("cmcm.out","w",stdout);
        scanf("%d %d %d",&n,&m,&e);

    s = 1; d = n + m + 2;
        for(int i=1;i<=e;i++)
        {
            scanf("%d %d %d",&x,&y,&z);
            x++; y += n + 1;
            g[x].push_back(y);
            g[y].push_back(x);
            c[x][y] = 1;
            o[x][y] = i;
            p[x][y] = z;
            p[y][x] = -z;

            g[1].push_back(x);
            g[x].push_back(1);
            c[1][x] = 1;

            if(!was[y])
            {
                was[y] = 1;
                g[y].push_back(d);
                g[d].push_back(y);
                c[y][d] = 1;
            }
        }
    cuplaj();
    return 0;
}