#include <cstdio>
#include <vector>
#include <algorithm>
#include <bitset>
#include <queue>
#include <cstring>
 
 
#define INF 0x3f3f3f3f
#define Nmax 610
#define super_start 605
#define super_sink 607
 
using namespace std;
int st,dr,M,DP[Nmax],daddy[Nmax];
int flow[Nmax][Nmax],capacity[Nmax][Nmax],cost[Nmax][Nmax],ind[Nmax][Nmax];
vector<int> G[Nmax];
queue<int> Q;
bitset<Nmax> inQ;
 
void Read()
{
    scanf("%d%d%d",&st,&dr,&M);
    int a,b,c;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%d%d%d",&a,&b,&c);
        b += st;
        capacity[a][b] = 1;
        capacity[b][a] = 0;
        cost[a][b] = c;
        cost[b][a] = -c;
        ind[a][b] = i;
        ind[b][a] = i;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    for(int i = 1; i <= st; ++i){
        G[super_start].push_back(i);
        G[i].push_back(super_start);
        capacity[super_start][i] = 1;
        capacity[i][super_start] = 0;
    }
    for(int i = st + 1; i <= st + dr; ++i){
        G[i].push_back(super_sink);
        G[super_sink].push_back(i);
        capacity[i][super_sink] = 1;
        capacity[super_sink][i] = 0;
    }
}
 
bool Bellman_Ford(int k)
{
    memset(DP,INF,sizeof(DP));
    DP[k] = 0;
    Q.push(k);
    while(!Q.empty())
    {
        k = Q.front();
        Q.pop();
        inQ[k] = 0;
        if(k == super_sink) continue;
        for(vector<int>::iterator it = G[k].begin(); it != G[k].end(); ++it)
            if(DP[*it] > DP[k] + cost[k][*it] && capacity[k][*it] != flow[k][*it])
            {
                DP[*it] = DP[k] + cost[k][*it];
                daddy[*it] = k;
                if(inQ[*it]) continue;
                inQ[*it] = 1;
                Q.push(*it);
            }
    }
    return DP[super_sink] != INF;
}
 
void FLOW(int k)
{
    int minFLOW,maxFLOW = 0,minCOST = 0;
    while(Bellman_Ford(k))
    for(vector<int>::iterator it = G[k].begin(); it != G[k].end(); ++it)
    {
        minFLOW = INF;
        for(int nodc = super_sink; nodc != super_start; nodc = daddy[nodc])
            minFLOW = min(minFLOW,capacity[daddy[nodc]][nodc] - flow[daddy[nodc]][nodc]);
        for(int nodc = super_sink; nodc != super_start; nodc = daddy[nodc])
        {
            flow[daddy[nodc]][nodc] += minFLOW;
            flow[nodc][daddy[nodc]] -= minFLOW;
        }
        maxFLOW += minFLOW;
        minCOST += minFLOW * DP[super_sink];
    }
    printf("%d %d\n",maxFLOW,minCOST);
}
 
void Get_answer()
{
    for(int i = 1; i <= st; ++i)
        for(int j = st + 1; j <= st + dr; ++j)
            if(flow[i][j] == 1)
                printf("%d ",ind[i][j]);
}
 
int main()
{
    freopen("cmcm.in","r",stdin);
    freopen("cmcm.out","w",stdout);
 
    Read();
    FLOW(super_start);
    Get_answer();
 
    return 0;
}