#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define INF numeric_limits<int>::max()
#define int64 long long
#define lsb(x) (-x)&(x)
using namespace std;
ifstream in("cmcm.in");
ofstream out("cmcm.out");
int ind[700][700],cost[700][700],flow[700][700],cap[700][700],n,m,dist[700],pre[700],S,D;
queue<int> Q;
vector< vector<int> > adj(700);
bool use[700];
bool bellman()
{
    for(int i=1;i<=603;i++)
    {
        pre[i]=0;
        dist[i]=INF;
        use[i]=false;
    }
    dist[S]=0;
    pre[S]=S;
    Q.push(S);
    while(!Q.empty())
    {
        int x=Q.front();
        use[x]=false;
        Q.pop();
        for(auto it: adj[x])
        if(cap[x][it]>flow[x][it] && dist[it] > dist[x] + cost[x][it])
        {
            dist[it]=dist[x]+cost[x][it];
            pre[it]=x;
            if(use[it]==false)
            {
                use[it]=true;
                Q.push(it);
            }
        }
    }
    return (pre[D]!=0);
}
int main()
{
    int t;
    in>>n>>m>>t;
    for(int i=1;i<=t;i++)
    {
        int x,y,z;
        in>>x>>y>>z;
        y+=300;
        adj[x].pb(y);
        adj[y].pb(x);
        cap[x][y]=1;
        cost[x][y]=z;
        cost[y][x]=-z;
        ind[x][y]=i;
    }
    S=601;
    D=602;
    for(int i=1;i<=n;i++)
    {
        adj[S].pb(i);
        adj[i].pb(S);
        cap[S][i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        adj[i+300].pb(D);
        adj[D].pb(i+300);
        cap[i+300][D]=1;
    }
    int maxflow=0,totalCost=0;
    while(bellman()==true)
    {
        int mx=INF;
        for(int x=D;x!=pre[x];x=pre[x])
            mx=min(mx,cap[ pre[x] ][x]-flow[ pre[x] ][x]);
        for(int x=D;x!=pre[x];x=pre[x])
        {
            flow[ pre[x] ][x]+=mx;
            flow[x][ pre[x] ]-=mx;
            totalCost+=mx*cost[ pre[x] ][x];
        }
        maxflow+=mx;
    }
    out<<maxflow<<' '<<totalCost<<'\n';
    for(int i=1;i<=n;i++)
    {
        for(auto it: adj[i])
            if(flow[i][it]==cap[i][it])
                out<<ind[i][it]<<' ';
    }
    return 0;
}