#include <bits/stdc++.h>
using namespace std;;
ifstream fi("cmcm.in");
ofstream fo("cmcm.out");

const int NMAX = 305;
const int INF = 1e9 + 5;

int n, m, e;
int cost[NMAX][NMAX], F[NMAX][NMAX], C[NMAX][NMAX];
vector <int> G[NMAX];
int vechi[NMAX], nou[NMAX], adev[NMAX];
bool inCoada[NMAX];
int p[NMAX];
int loc[NMAX][NMAX];

void adauga(int u, int v, int c)
{
    G[u].push_back(v);
    G[v].push_back(u);
    cost[u][v] = c;
    cost[v][u] = -c;
    C[u][v] = 1;
    C[v][u] = 0;
}

void bellmanford()
{
    for (int i = 0; i <= n + m + 1; i++)
        vechi[i] = INF;

    queue <int> Q;
    Q.push(0);
    inCoada[0] = 1;
    vechi[0] = 0;

    while (!Q.empty())
    {
        int nod = Q.front();
        Q.pop();
        inCoada[nod] = 0;

        for (auto v: G[nod])
        {
            if (vechi[nod] + cost[nod][v] < vechi[v] && C[nod][v] == 1)
            {
                vechi[v] = vechi[nod] + cost[nod][v];
                if (!inCoada[v])
                {
                    Q.push(v);
                    inCoada[v] = 1;
                }
            }
        }
    }
}

bool dijkstra()
{
    memset(p, -1, sizeof(p));
    for (int i = 0; i <= n + m + 1; i++)
        nou[i] = adev[i] = INF;

    priority_queue < pair<int, int> > Q;
    Q.push({0, 0});
    nou[0] = adev[0] = 0;

    while (!Q.empty())
    {
        pair <int, int> curr = Q.top();
        Q.pop();

        int nod = curr.second;
        if (nou[nod] != -curr.first)
            continue;

        for (auto v: G[nod])
        {
            if (nou[nod] + cost[nod][v] + vechi[nod] - vechi[v] < nou[v] && F[nod][v] != C[nod][v])
            {
                nou[v] = nou[nod] + cost[nod][v] + vechi[nod] - vechi[v];
                adev[v] = adev[nod] + cost[nod][v];
                p[v] = nod;
                Q.push({-nou[v], v});
            }
        }
    }
    return nou[n + m + 1] != INF;
}

int main()
{
    fi >> n >> m >> e;
    for (int i = 1; i <= e; i++)
    {
        int u, v, c;
        fi >> u >> v >> c;
        v += n;
        loc[u][v] = i;
        adauga(u, v, c);

        adauga(0, u, 0);
        adauga(v, n + m + 1, 0);
    }

    bellmanford();

    int rez = 0;
    while (dijkstra())
    {
        int minim = INF;
        for (int i = n + m + 1; i != 0; i = p[i])
        {
            minim = min(minim, C[p[i]][i] - F[p[i]][i]);
        }

        for (int i = n + m + 1; i != 0; i = p[i])
        {
            F[p[i]][i] += minim;
            F[i][p[i]] -= minim;
        }

        rez += (nou[n + m + 1] + vechi[n + m + 1]) * minim;

        memcpy(vechi, nou, sizeof(nou));
    }

    int nrm = 0;
    vector <int> rrr;
    for (int i = 1; i <= n; i++)
    {
        for (auto v: G[i])
            if (F[i][v] == C[i][v] && C[i][v] == 1)
                nrm++, rrr.push_back(loc[i][v]);
    }

    fo << nrm << " " << rez << "\n";
    for (auto x: rrr)
        fo << x << " ";

    return 0;
}