#include <bits/stdc++.h>

#define Left(node) (node)
#define Right(node) (node + n)

using namespace std;

const int Nmax = 2 * 300 + 10;
const int inf = 0x3f3f3f3f;

int n , m , i , j , edges , flow , nrE , S , D;
int bst[Nmax] , dad[Nmax];
int c[Nmax][Nmax] , f[Nmax][Nmax] , p[Nmax][Nmax] , info[Nmax][Nmax];

bool marked[Nmax];

vector < int > g[Nmax];
queue < int > q;

void add(int node1 , int node2 , int cost)
{
    g[node1].push_back(node2);
    g[node2].push_back(node1);

    c[node1][node2] = 1;
    p[node1][node2] = cost;
    p[node2][node1] = cost * (-1);
}

bool bfs()
{
    memset(bst , inf , sizeof(bst));
    memset(marked , 0 , sizeof(marked));
    memset(dad , 0 , sizeof(dad));

    for (q.push(S),marked[S]=1,bst[S]=0; !q.empty(); q.pop())
    {
        int node = q.front(); marked[node] = 0;

        for (auto &it : g[node])
            if (bst[it] > bst[node] + p[node][it] && c[node][it] > f[node][it])
            {
                bst[it] = bst[node] + p[node][it];
                dad[it] = node;
                if (!marked[it]) marked[it] = 1, q.push(it);
            }
    }

    return dad[D];
}

void fluxx()
{
    for (bool ok = bfs(); ok ; ok = bfs())
    {
        int minn = inf;
        for (int node = D; node != S; node = dad[node])
            minn = min(minn , c[dad[node]][node] - f[dad[node]][node]);

        flow += minn * bst[D]; nrE += minn;
        for (int node = D; node != S; node = dad[node])
            f[dad[node]][node] += minn,
            f[node][dad[node]] -= minn;
    }
}

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

    scanf("%d %d %d", &n, &m , &edges);

    S = 0; D = n + m + 1;
    for (i = 1; i <= n; ++i)
        add(S , Left(i) , 0);
    for (i = 1; i <= m; ++i)
        add(Right(i) , D , 0);

    for (i = 1; i <= edges; ++i)
    {
        int node1, node2 , cost;
        scanf("%d %d %d", &node1, &node2, &cost);

        add(Left(node1) , Right(node2) , cost);
        info[node1][node2] = i;
    }

    fluxx();

    printf("%d %d\n", nrE , flow);
    for (i = 1; i <= n; ++i)
        for (j = 1; j <= m; ++j)
            if (f[Left(i)][Right(j)])
                printf("%d ", info[i][j]);

    printf("\n");

    return 0;
}