#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

#define INF 0x3f3f3f3f
#define pb push_back
#define mp make_pair
#define MAX 50005
#define sc second
#define fs first
#define DIM 605

vector <pair <int,int> > g[DIM];
int n,m,e,SRC,DST,cost,cuplaj;
int c[DIM][DIM],f[DIM][DIM];
pair <int,int> muc[MAX];
int dst[DIM],t[DIM];
bool viz[DIM];

struct cmp
{
    bool operator () (const int &a,const int &b)
    {
        return dst[a]>dst[b];
    }
}; priority_queue <int,vector <int>,cmp> q;

void read ()
{
    int i,x,y,z;

    scanf ("%d%d%d",&n,&m,&e);
    for (i=1; i<=e; ++i)
    {
        scanf ("%d%d%d",&x,&y,&z);
        g[x].pb (mp (y+n,z));
        g[y+n].pb (mp (x,-z));
        muc[i]=mp (x,y);
        c[x][y+n]=1;
    }
    SRC=0; DST=n+m+1;
    for (i=1; i<=n; ++i)
    {
        g[SRC].pb (mp (i,0));
        g[i].pb (mp (SRC,0));
        c[SRC][i]=1;
    }
    for (i=1; i<=m; ++i)
    {
        g[i+n].pb (mp (DST,0));
        g[DST].pb (mp (i+n,0));
        c[i+n][DST]=1;
    }
}

int dijkstra ()
{
    vector <pair <int,int> > :: iterator it;
    int nod;

    memset (t,0,sizeof (t));
    memset (viz,0,sizeof (viz));
    memset (dst,INF,sizeof (dst));
    dst[SRC]=0;
    for (q.push (SRC); !q.empty (); )
    {
        viz[nod=q.top ()]=0; q.pop ();
        for (it=g[nod].begin (); it!=g[nod].end (); ++it)
            if (dst[nod]+it->sc<dst[it->fs] && c[nod][it->fs]!=f[nod][it->fs])
            {
                dst[it->fs]=dst[nod]+it->sc;
                t[it->fs]=nod;
                if (!viz[it->fs])
                {
                    viz[it->fs]=1;
                    q.push (it->fs);
                }
            }
    }

    return dst[DST]!=INF;
}


void solve ()
{
    vector <int> :: iterator it;
    int i,min_cur;

    for ( ; dijkstra (); )
    {
        min_cur=INF;
        for (i=DST; i!=SRC; i=t[i])
            min_cur=min (min_cur,c[t[i]][i]-f[t[i]][i]);
        for (i=DST; i!=SRC; i=t[i])
        {
            f[t[i]][i]+=min_cur;
            f[i][t[i]]-=min_cur;
        }
        cost+=min_cur*dst[DST];
        cuplaj+=min_cur;
    }
}

void print ()
{
    int i;

    printf ("%d %d\n",cuplaj,cost);
    for (i=1; i<=e; ++i)
        if (f[muc[i].fs][muc[i].sc+n])
            printf ("%d ",i);
}

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

    read ();
    solve ();
    print ();

    return 0;
}